/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 18:10:02,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 18:10:02,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 18:10:02,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 18:10:02,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 18:10:02,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 18:10:02,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 18:10:02,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 18:10:02,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 18:10:02,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 18:10:02,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 18:10:02,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 18:10:02,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 18:10:02,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 18:10:02,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 18:10:02,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 18:10:02,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 18:10:02,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 18:10:02,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 18:10:02,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 18:10:02,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 18:10:02,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 18:10:02,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 18:10:02,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 18:10:02,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 18:10:02,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 18:10:02,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 18:10:02,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 18:10:02,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 18:10:02,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 18:10:02,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 18:10:02,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 18:10:02,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 18:10:02,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 18:10:02,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 18:10:02,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 18:10:02,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 18:10:02,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 18:10:02,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 18:10:02,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 18:10:02,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 18:10:02,994 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.epf [2021-06-05 18:10:03,028 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 18:10:03,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 18:10:03,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 18:10:03,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 18:10:03,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 18:10:03,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 18:10:03,031 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 18:10:03,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 18:10:03,032 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 18:10:03,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 18:10:03,033 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 18:10:03,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 18:10:03,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 18:10:03,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 18:10:03,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 18:10:03,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 18:10:03,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 18:10:03,035 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 18:10:03,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 18:10:03,035 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 18:10:03,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 18:10:03,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 18:10:03,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 18:10:03,325 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 18:10:03,325 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 18:10:03,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2021-06-05 18:10:03,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8336d593d/891dfceb1cfd4c4f83fcb86c88d34d93/FLAGeb976f8e0 [2021-06-05 18:10:03,874 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 18:10:03,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2021-06-05 18:10:03,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8336d593d/891dfceb1cfd4c4f83fcb86c88d34d93/FLAGeb976f8e0 [2021-06-05 18:10:04,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8336d593d/891dfceb1cfd4c4f83fcb86c88d34d93 [2021-06-05 18:10:04,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 18:10:04,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 18:10:04,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 18:10:04,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 18:10:04,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 18:10:04,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281f767f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04, skipping insertion in model container [2021-06-05 18:10:04,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 18:10:04,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 18:10:04,547 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/stack-2.i[41520,41533] [2021-06-05 18:10:04,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:10:04,586 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 18:10:04,612 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/stack-2.i[41520,41533] [2021-06-05 18:10:04,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:10:04,727 INFO L208 MainTranslator]: Completed translation [2021-06-05 18:10:04,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04 WrapperNode [2021-06-05 18:10:04,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 18:10:04,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 18:10:04,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 18:10:04,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 18:10:04,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 18:10:04,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 18:10:04,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 18:10:04,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 18:10:04,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (1/1) ... [2021-06-05 18:10:04,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 18:10:04,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 18:10:04,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 18:10:04,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 18:10:04,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (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 18:10:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 18:10:04,878 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 18:10:04,878 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 18:10:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 18:10:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 18:10:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 18:10:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 18:10:04,882 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 18:10:05,308 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 18:10:05,309 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-06-05 18:10:05,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:10:05 BoogieIcfgContainer [2021-06-05 18:10:05,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 18:10:05,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 18:10:05,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 18:10:05,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 18:10:05,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 06:10:04" (1/3) ... [2021-06-05 18:10:05,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c747889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:10:05, skipping insertion in model container [2021-06-05 18:10:05,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:10:04" (2/3) ... [2021-06-05 18:10:05,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c747889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:10:05, skipping insertion in model container [2021-06-05 18:10:05,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:10:05" (3/3) ... [2021-06-05 18:10:05,318 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2021-06-05 18:10:05,325 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 18:10:05,326 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 18:10:05,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 18:10:05,326 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 18:10:05,373 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,373 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,373 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,373 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,373 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,374 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,375 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,376 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,376 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,376 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,376 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,376 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,377 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,377 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,377 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,377 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,378 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,378 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,379 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,379 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,382 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,383 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,383 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,393 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,393 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,398 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,398 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,402 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,402 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,404 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,404 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,404 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,404 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,405 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,406 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,407 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,408 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,409 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,410 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,411 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,412 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,413 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,419 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,419 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,419 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,420 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,421 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,421 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,421 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,421 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,422 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,424 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,425 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,425 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,425 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,426 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,426 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,426 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,426 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,426 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,427 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,428 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,428 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,428 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,428 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,428 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,429 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,429 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,429 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,429 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,429 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,430 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,430 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,430 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,430 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,430 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,432 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,432 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,442 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,443 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,443 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:10:05,454 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 18:10:05,474 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:05,504 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:05,504 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:05,504 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:05,504 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:05,504 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:05,504 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:05,504 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:05,504 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1Thread1of1ForFork0======== [2021-06-05 18:10:05,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 161 transitions, 344 flow [2021-06-05 18:10:06,024 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 18:10:06,108 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:06,109 INFO L554 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] [2021-06-05 18:10:06,109 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1983023351, now seen corresponding path program 1 times [2021-06-05 18:10:06,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:06,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390092314] [2021-06-05 18:10:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:06,416 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 18:10:06,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:06,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390092314] [2021-06-05 18:10:06,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390092314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:06,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:06,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:10:06,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990757920] [2021-06-05 18:10:06,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:10:06,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:10:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:06,459 INFO L87 Difference]: Start difference. First operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 18:10:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:06,646 INFO L93 Difference]: Finished difference Result 14515 states and 39967 transitions. [2021-06-05 18:10:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:10:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-06-05 18:10:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:06,735 INFO L225 Difference]: With dead ends: 14515 [2021-06-05 18:10:06,735 INFO L226 Difference]: Without dead ends: 12848 [2021-06-05 18:10:06,736 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12848 states. [2021-06-05 18:10:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12848 to 11435. [2021-06-05 18:10:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 11433 states have (on average 2.770926266071897) internal successors, (31680), 11434 states have internal predecessors, (31680), 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 18:10:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 31680 transitions. [2021-06-05 18:10:07,357 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 31680 transitions. Word has length 58 [2021-06-05 18:10:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:07,359 INFO L482 AbstractCegarLoop]: Abstraction has 11435 states and 31680 transitions. [2021-06-05 18:10:07,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 18:10:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 31680 transitions. [2021-06-05 18:10:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 18:10:07,370 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:07,371 INFO L554 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 18:10:07,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 18:10:07,371 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -24631517, now seen corresponding path program 1 times [2021-06-05 18:10:07,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:07,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713263670] [2021-06-05 18:10:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:07,506 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 18:10:07,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:07,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713263670] [2021-06-05 18:10:07,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713263670] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:07,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:07,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 18:10:07,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325784251] [2021-06-05 18:10:07,509 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 18:10:07,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 18:10:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 18:10:07,510 INFO L87 Difference]: Start difference. First operand 11435 states and 31680 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 18:10:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:07,763 INFO L93 Difference]: Finished difference Result 15295 states and 42320 transitions. [2021-06-05 18:10:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 18:10:07,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 18:10:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:07,831 INFO L225 Difference]: With dead ends: 15295 [2021-06-05 18:10:07,831 INFO L226 Difference]: Without dead ends: 15295 [2021-06-05 18:10:07,832 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 18:10:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15295 states. [2021-06-05 18:10:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15295 to 12014. [2021-06-05 18:10:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12014 states, 12012 states have (on average 2.7702297702297702) internal successors, (33276), 12013 states have internal predecessors, (33276), 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 18:10:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12014 states to 12014 states and 33276 transitions. [2021-06-05 18:10:08,297 INFO L78 Accepts]: Start accepts. Automaton has 12014 states and 33276 transitions. Word has length 67 [2021-06-05 18:10:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:08,298 INFO L482 AbstractCegarLoop]: Abstraction has 12014 states and 33276 transitions. [2021-06-05 18:10:08,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 18:10:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 12014 states and 33276 transitions. [2021-06-05 18:10:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 18:10:08,314 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:08,314 INFO L554 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] [2021-06-05 18:10:08,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 18:10:08,314 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:08,315 INFO L82 PathProgramCache]: Analyzing trace with hash -939681264, now seen corresponding path program 1 times [2021-06-05 18:10:08,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:08,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607402708] [2021-06-05 18:10:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:08,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 18:10:08,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:08,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607402708] [2021-06-05 18:10:08,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607402708] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:08,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:08,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 18:10:08,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576287970] [2021-06-05 18:10:08,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 18:10:08,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 18:10:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 18:10:08,406 INFO L87 Difference]: Start difference. First operand 12014 states and 33276 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 18:10:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:08,657 INFO L93 Difference]: Finished difference Result 19272 states and 53355 transitions. [2021-06-05 18:10:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 18:10:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2021-06-05 18:10:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:08,703 INFO L225 Difference]: With dead ends: 19272 [2021-06-05 18:10:08,703 INFO L226 Difference]: Without dead ends: 19272 [2021-06-05 18:10:08,703 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 18:10:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19272 states. [2021-06-05 18:10:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19272 to 12552. [2021-06-05 18:10:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12552 states, 12550 states have (on average 2.767808764940239) internal successors, (34736), 12551 states have internal predecessors, (34736), 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 18:10:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 34736 transitions. [2021-06-05 18:10:09,078 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 34736 transitions. Word has length 84 [2021-06-05 18:10:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:09,080 INFO L482 AbstractCegarLoop]: Abstraction has 12552 states and 34736 transitions. [2021-06-05 18:10:09,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 18:10:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 34736 transitions. [2021-06-05 18:10:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 18:10:09,178 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:09,178 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:09,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 18:10:09,179 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1191059461, now seen corresponding path program 1 times [2021-06-05 18:10:09,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:09,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599029693] [2021-06-05 18:10:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:09,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:09,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599029693] [2021-06-05 18:10:09,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599029693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:09,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12199354] [2021-06-05 18:10:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:09,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 18:10:09,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:09,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12199354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:09,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:09,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 18:10:09,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758383212] [2021-06-05 18:10:09,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 18:10:09,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 18:10:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 18:10:09,691 INFO L87 Difference]: Start difference. First operand 12552 states and 34736 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 18:10:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:09,905 INFO L93 Difference]: Finished difference Result 18885 states and 52109 transitions. [2021-06-05 18:10:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 18:10:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 93 [2021-06-05 18:10:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:09,948 INFO L225 Difference]: With dead ends: 18885 [2021-06-05 18:10:09,948 INFO L226 Difference]: Without dead ends: 18885 [2021-06-05 18:10:09,948 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 31.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 18:10:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2021-06-05 18:10:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 17189. [2021-06-05 18:10:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17189 states, 17187 states have (on average 2.7595275498923604) internal successors, (47428), 17188 states have internal predecessors, (47428), 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 18:10:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17189 states to 17189 states and 47428 transitions. [2021-06-05 18:10:10,389 INFO L78 Accepts]: Start accepts. Automaton has 17189 states and 47428 transitions. Word has length 93 [2021-06-05 18:10:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:10,389 INFO L482 AbstractCegarLoop]: Abstraction has 17189 states and 47428 transitions. [2021-06-05 18:10:10,389 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 18:10:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17189 states and 47428 transitions. [2021-06-05 18:10:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 18:10:10,419 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:10,419 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:10,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:10,633 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -783912900, now seen corresponding path program 1 times [2021-06-05 18:10:10,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:10,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713684255] [2021-06-05 18:10:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 18:10:10,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:10,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713684255] [2021-06-05 18:10:10,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713684255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:10,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:10,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:10:10,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429120611] [2021-06-05 18:10:10,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:10:10,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:10:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:10,695 INFO L87 Difference]: Start difference. First operand 17189 states and 47428 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 18:10:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:10,736 INFO L93 Difference]: Finished difference Result 6921 states and 17823 transitions. [2021-06-05 18:10:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:10:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 119 [2021-06-05 18:10:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:10,750 INFO L225 Difference]: With dead ends: 6921 [2021-06-05 18:10:10,750 INFO L226 Difference]: Without dead ends: 6729 [2021-06-05 18:10:10,750 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2021-06-05 18:10:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 6649. [2021-06-05 18:10:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6649 states, 6647 states have (on average 2.5766511208063787) internal successors, (17127), 6648 states have internal predecessors, (17127), 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 18:10:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 17127 transitions. [2021-06-05 18:10:10,988 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 17127 transitions. Word has length 119 [2021-06-05 18:10:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:10,988 INFO L482 AbstractCegarLoop]: Abstraction has 6649 states and 17127 transitions. [2021-06-05 18:10:10,988 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 18:10:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 17127 transitions. [2021-06-05 18:10:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 18:10:11,000 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:11,001 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:11,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 18:10:11,001 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:11,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash 804766153, now seen corresponding path program 2 times [2021-06-05 18:10:11,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:11,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397382112] [2021-06-05 18:10:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:11,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:11,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397382112] [2021-06-05 18:10:11,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397382112] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:11,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786253027] [2021-06-05 18:10:11,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:11,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 18:10:11,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:11,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 18:10:11,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:11,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786253027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:11,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:11,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 18:10:11,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964003319] [2021-06-05 18:10:11,489 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 18:10:11,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:11,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 18:10:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 18:10:11,491 INFO L87 Difference]: Start difference. First operand 6649 states and 17127 transitions. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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 18:10:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:11,606 INFO L93 Difference]: Finished difference Result 9521 states and 24504 transitions. [2021-06-05 18:10:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 18:10:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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 128 [2021-06-05 18:10:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:11,628 INFO L225 Difference]: With dead ends: 9521 [2021-06-05 18:10:11,628 INFO L226 Difference]: Without dead ends: 9521 [2021-06-05 18:10:11,628 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:10:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2021-06-05 18:10:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 8884. [2021-06-05 18:10:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8884 states, 8882 states have (on average 2.5761089844629588) internal successors, (22881), 8883 states have internal predecessors, (22881), 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 18:10:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8884 states to 8884 states and 22881 transitions. [2021-06-05 18:10:11,814 INFO L78 Accepts]: Start accepts. Automaton has 8884 states and 22881 transitions. Word has length 128 [2021-06-05 18:10:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:11,815 INFO L482 AbstractCegarLoop]: Abstraction has 8884 states and 22881 transitions. [2021-06-05 18:10:11,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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 18:10:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8884 states and 22881 transitions. [2021-06-05 18:10:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-06-05 18:10:11,829 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:11,829 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:12,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:12,053 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1848043510, now seen corresponding path program 1 times [2021-06-05 18:10:12,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:12,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736935784] [2021-06-05 18:10:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:12,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:12,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736935784] [2021-06-05 18:10:12,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736935784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:12,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769967737] [2021-06-05 18:10:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:12,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 18:10:12,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:12,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769967737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:12,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:12,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-06-05 18:10:12,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004905928] [2021-06-05 18:10:12,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 18:10:12,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 18:10:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 18:10:12,485 INFO L87 Difference]: Start difference. First operand 8884 states and 22881 transitions. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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 18:10:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:12,651 INFO L93 Difference]: Finished difference Result 12154 states and 31386 transitions. [2021-06-05 18:10:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 18:10:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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 133 [2021-06-05 18:10:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:12,674 INFO L225 Difference]: With dead ends: 12154 [2021-06-05 18:10:12,674 INFO L226 Difference]: Without dead ends: 12154 [2021-06-05 18:10:12,675 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:10:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12154 states. [2021-06-05 18:10:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12154 to 10704. [2021-06-05 18:10:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10704 states, 10702 states have (on average 2.5978321809007663) internal successors, (27802), 10703 states have internal predecessors, (27802), 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 18:10:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10704 states to 10704 states and 27802 transitions. [2021-06-05 18:10:12,848 INFO L78 Accepts]: Start accepts. Automaton has 10704 states and 27802 transitions. Word has length 133 [2021-06-05 18:10:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:12,848 INFO L482 AbstractCegarLoop]: Abstraction has 10704 states and 27802 transitions. [2021-06-05 18:10:12,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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 18:10:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10704 states and 27802 transitions. [2021-06-05 18:10:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-06-05 18:10:12,866 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:12,867 INFO L554 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:13,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:13,089 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 139304251, now seen corresponding path program 3 times [2021-06-05 18:10:13,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:13,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410770459] [2021-06-05 18:10:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:13,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:13,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410770459] [2021-06-05 18:10:13,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410770459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:13,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252307064] [2021-06-05 18:10:13,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:13,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 18:10:13,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:13,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 18:10:13,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:13,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252307064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:13,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:13,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 18:10:13,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554725932] [2021-06-05 18:10:13,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 18:10:13,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 18:10:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:10:13,640 INFO L87 Difference]: Start difference. First operand 10704 states and 27802 transitions. Second operand has 11 states, 11 states have (on average 19.454545454545453) internal successors, (214), 11 states have internal predecessors, (214), 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 18:10:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:13,777 INFO L93 Difference]: Finished difference Result 14711 states and 37953 transitions. [2021-06-05 18:10:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 18:10:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 19.454545454545453) internal successors, (214), 11 states have internal predecessors, (214), 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 163 [2021-06-05 18:10:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:13,802 INFO L225 Difference]: With dead ends: 14711 [2021-06-05 18:10:13,802 INFO L226 Difference]: Without dead ends: 14711 [2021-06-05 18:10:13,803 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 73.0ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 18:10:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14711 states. [2021-06-05 18:10:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14711 to 12939. [2021-06-05 18:10:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12939 states, 12937 states have (on average 2.5938007265981295) internal successors, (33556), 12938 states have internal predecessors, (33556), 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 18:10:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12939 states to 12939 states and 33556 transitions. [2021-06-05 18:10:14,013 INFO L78 Accepts]: Start accepts. Automaton has 12939 states and 33556 transitions. Word has length 163 [2021-06-05 18:10:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:14,013 INFO L482 AbstractCegarLoop]: Abstraction has 12939 states and 33556 transitions. [2021-06-05 18:10:14,014 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 19.454545454545453) internal successors, (214), 11 states have internal predecessors, (214), 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 18:10:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12939 states and 33556 transitions. [2021-06-05 18:10:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-06-05 18:10:14,030 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:14,030 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:14,231 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:14,231 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2103744908, now seen corresponding path program 2 times [2021-06-05 18:10:14,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:14,232 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135399375] [2021-06-05 18:10:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:14,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:14,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135399375] [2021-06-05 18:10:14,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135399375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:14,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162895828] [2021-06-05 18:10:14,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:14,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 18:10:14,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 18:10:14,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:14,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162895828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:14,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:14,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 18:10:14,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770192636] [2021-06-05 18:10:14,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:10:14,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:10:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:10:14,765 INFO L87 Difference]: Start difference. First operand 12939 states and 33556 transitions. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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 18:10:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:14,899 INFO L93 Difference]: Finished difference Result 17344 states and 44835 transitions. [2021-06-05 18:10:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 18:10:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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 168 [2021-06-05 18:10:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:14,926 INFO L225 Difference]: With dead ends: 17344 [2021-06-05 18:10:14,926 INFO L226 Difference]: Without dead ends: 17344 [2021-06-05 18:10:14,927 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 18:10:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17344 states. [2021-06-05 18:10:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17344 to 12939. [2021-06-05 18:10:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12939 states, 12937 states have (on average 2.5938007265981295) internal successors, (33556), 12938 states have internal predecessors, (33556), 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 18:10:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12939 states to 12939 states and 33556 transitions. [2021-06-05 18:10:15,164 INFO L78 Accepts]: Start accepts. Automaton has 12939 states and 33556 transitions. Word has length 168 [2021-06-05 18:10:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:15,164 INFO L482 AbstractCegarLoop]: Abstraction has 12939 states and 33556 transitions. [2021-06-05 18:10:15,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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 18:10:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 12939 states and 33556 transitions. [2021-06-05 18:10:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-06-05 18:10:15,184 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:15,184 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:15,408 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:15,408 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1053229943, now seen corresponding path program 4 times [2021-06-05 18:10:15,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:15,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636485225] [2021-06-05 18:10:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:15,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:15,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636485225] [2021-06-05 18:10:15,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636485225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:15,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291399998] [2021-06-05 18:10:15,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:15,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 18:10:15,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:15,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 18:10:15,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:16,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291399998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:16,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:16,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 18:10:16,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48134018] [2021-06-05 18:10:16,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 18:10:16,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 18:10:16,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:10:16,012 INFO L87 Difference]: Start difference. First operand 12939 states and 33556 transitions. Second operand has 13 states, 13 states have (on average 19.153846153846153) internal successors, (249), 13 states have internal predecessors, (249), 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 18:10:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:16,192 INFO L93 Difference]: Finished difference Result 17026 states and 43911 transitions. [2021-06-05 18:10:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:10:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 19.153846153846153) internal successors, (249), 13 states have internal predecessors, (249), 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 198 [2021-06-05 18:10:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:16,219 INFO L225 Difference]: With dead ends: 17026 [2021-06-05 18:10:16,219 INFO L226 Difference]: Without dead ends: 17026 [2021-06-05 18:10:16,220 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:10:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2021-06-05 18:10:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 15174. [2021-06-05 18:10:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15174 states, 15172 states have (on average 2.5909570261007118) internal successors, (39310), 15173 states have internal predecessors, (39310), 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 18:10:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15174 states to 15174 states and 39310 transitions. [2021-06-05 18:10:16,536 INFO L78 Accepts]: Start accepts. Automaton has 15174 states and 39310 transitions. Word has length 198 [2021-06-05 18:10:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:16,536 INFO L482 AbstractCegarLoop]: Abstraction has 15174 states and 39310 transitions. [2021-06-05 18:10:16,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 19.153846153846153) internal successors, (249), 13 states have internal predecessors, (249), 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 18:10:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15174 states and 39310 transitions. [2021-06-05 18:10:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-06-05 18:10:16,555 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:16,555 INFO L554 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:16,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:16,769 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -747494154, now seen corresponding path program 3 times [2021-06-05 18:10:16,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:16,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529303065] [2021-06-05 18:10:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 138 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 18:10:16,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:16,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529303065] [2021-06-05 18:10:16,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529303065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:16,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788950751] [2021-06-05 18:10:16,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:17,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 18:10:17,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:17,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 18:10:17,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 115 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-06-05 18:10:17,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788950751] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:17,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:17,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2021-06-05 18:10:17,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29021026] [2021-06-05 18:10:17,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:10:17,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:17,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:10:17,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:10:17,488 INFO L87 Difference]: Start difference. First operand 15174 states and 39310 transitions. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 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 18:10:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:17,652 INFO L93 Difference]: Finished difference Result 20209 states and 52402 transitions. [2021-06-05 18:10:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 18:10:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 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 203 [2021-06-05 18:10:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:17,678 INFO L225 Difference]: With dead ends: 20209 [2021-06-05 18:10:17,678 INFO L226 Difference]: Without dead ends: 20209 [2021-06-05 18:10:17,679 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-06-05 18:10:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20209 states. [2021-06-05 18:10:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20209 to 16994. [2021-06-05 18:10:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16994 states, 16992 states have (on average 2.603048493408663) internal successors, (44231), 16993 states have internal predecessors, (44231), 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 18:10:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16994 states to 16994 states and 44231 transitions. [2021-06-05 18:10:17,952 INFO L78 Accepts]: Start accepts. Automaton has 16994 states and 44231 transitions. Word has length 203 [2021-06-05 18:10:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:17,952 INFO L482 AbstractCegarLoop]: Abstraction has 16994 states and 44231 transitions. [2021-06-05 18:10:17,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 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 18:10:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16994 states and 44231 transitions. [2021-06-05 18:10:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-06-05 18:10:17,973 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:17,973 INFO L554 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:18,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:18,189 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash -830216394, now seen corresponding path program 4 times [2021-06-05 18:10:18,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:18,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123829071] [2021-06-05 18:10:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:18,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:18,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123829071] [2021-06-05 18:10:18,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123829071] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:18,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408560140] [2021-06-05 18:10:18,297 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:18,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 18:10:18,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:18,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 18:10:18,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:18,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408560140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:18,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:18,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2021-06-05 18:10:18,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284636210] [2021-06-05 18:10:18,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:10:18,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:10:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:10:18,655 INFO L87 Difference]: Start difference. First operand 16994 states and 44231 transitions. Second operand has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 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 18:10:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:18,858 INFO L93 Difference]: Finished difference Result 21559 states and 55918 transitions. [2021-06-05 18:10:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:10:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 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 203 [2021-06-05 18:10:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:18,891 INFO L225 Difference]: With dead ends: 21559 [2021-06-05 18:10:18,891 INFO L226 Difference]: Without dead ends: 21559 [2021-06-05 18:10:18,892 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:10:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21559 states. [2021-06-05 18:10:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21559 to 16994. [2021-06-05 18:10:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16994 states, 16992 states have (on average 2.603048493408663) internal successors, (44231), 16993 states have internal predecessors, (44231), 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 18:10:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16994 states to 16994 states and 44231 transitions. [2021-06-05 18:10:19,270 INFO L78 Accepts]: Start accepts. Automaton has 16994 states and 44231 transitions. Word has length 203 [2021-06-05 18:10:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:19,270 INFO L482 AbstractCegarLoop]: Abstraction has 16994 states and 44231 transitions. [2021-06-05 18:10:19,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 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 18:10:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 16994 states and 44231 transitions. [2021-06-05 18:10:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-06-05 18:10:19,291 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:19,291 INFO L554 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:19,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 18:10:19,497 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1449366917, now seen corresponding path program 5 times [2021-06-05 18:10:19,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:19,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402332761] [2021-06-05 18:10:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 303 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:19,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:19,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402332761] [2021-06-05 18:10:19,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402332761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:19,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740549815] [2021-06-05 18:10:19,635 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:19,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 18:10:19,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:19,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 18:10:19,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:20,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740549815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:20,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 18:10:20,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2021-06-05 18:10:20,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932670554] [2021-06-05 18:10:20,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 18:10:20,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:20,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 18:10:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:10:20,073 INFO L87 Difference]: Start difference. First operand 16994 states and 44231 transitions. Second operand has 13 states, 13 states have (on average 17.923076923076923) internal successors, (233), 13 states have internal predecessors, (233), 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 18:10:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:20,353 INFO L93 Difference]: Finished difference Result 34886 states and 90981 transitions. [2021-06-05 18:10:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 18:10:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.923076923076923) internal successors, (233), 13 states have internal predecessors, (233), 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 233 [2021-06-05 18:10:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:20,382 INFO L225 Difference]: With dead ends: 34886 [2021-06-05 18:10:20,383 INFO L226 Difference]: Without dead ends: 19371 [2021-06-05 18:10:20,383 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2021-06-05 18:10:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19371 states. [2021-06-05 18:10:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19371 to 18186. [2021-06-05 18:10:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 18184 states have (on average 2.596183457985042) internal successors, (47209), 18185 states have internal predecessors, (47209), 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 18:10:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 47209 transitions. [2021-06-05 18:10:20,649 INFO L78 Accepts]: Start accepts. Automaton has 18186 states and 47209 transitions. Word has length 233 [2021-06-05 18:10:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:20,649 INFO L482 AbstractCegarLoop]: Abstraction has 18186 states and 47209 transitions. [2021-06-05 18:10:20,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 17.923076923076923) internal successors, (233), 13 states have internal predecessors, (233), 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 18:10:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18186 states and 47209 transitions. [2021-06-05 18:10:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-06-05 18:10:20,674 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:20,674 INFO L554 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:20,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:20,885 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1487708345, now seen corresponding path program 1 times [2021-06-05 18:10:20,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:20,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138729257] [2021-06-05 18:10:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 9 proven. 155 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-06-05 18:10:21,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:21,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138729257] [2021-06-05 18:10:21,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138729257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:21,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233824626] [2021-06-05 18:10:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:21,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 18:10:21,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 9 proven. 131 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-06-05 18:10:21,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233824626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:21,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:21,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2021-06-05 18:10:21,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626819205] [2021-06-05 18:10:21,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 18:10:21,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 18:10:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:10:21,472 INFO L87 Difference]: Start difference. First operand 18186 states and 47209 transitions. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 18:10:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:21,703 INFO L93 Difference]: Finished difference Result 29456 states and 76308 transitions. [2021-06-05 18:10:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 18:10:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 237 [2021-06-05 18:10:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:21,725 INFO L225 Difference]: With dead ends: 29456 [2021-06-05 18:10:21,726 INFO L226 Difference]: Without dead ends: 16081 [2021-06-05 18:10:21,726 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 103.3ms TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:10:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16081 states. [2021-06-05 18:10:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16081 to 14441. [2021-06-05 18:10:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14441 states, 14439 states have (on average 2.5730313733638064) internal successors, (37152), 14440 states have internal predecessors, (37152), 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 18:10:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14441 states to 14441 states and 37152 transitions. [2021-06-05 18:10:21,967 INFO L78 Accepts]: Start accepts. Automaton has 14441 states and 37152 transitions. Word has length 237 [2021-06-05 18:10:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:21,967 INFO L482 AbstractCegarLoop]: Abstraction has 14441 states and 37152 transitions. [2021-06-05 18:10:21,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 18:10:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 14441 states and 37152 transitions. [2021-06-05 18:10:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-06-05 18:10:21,982 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:21,983 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:22,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:22,186 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1149059822, now seen corresponding path program 5 times [2021-06-05 18:10:22,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:22,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398382907] [2021-06-05 18:10:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 258 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 18:10:22,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:22,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398382907] [2021-06-05 18:10:22,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398382907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:22,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692333537] [2021-06-05 18:10:22,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:22,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 18:10:22,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:22,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 18:10:22,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-06-05 18:10:22,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692333537] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:22,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:22,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 12 [2021-06-05 18:10:22,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834949764] [2021-06-05 18:10:22,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:10:22,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:10:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:10:22,826 INFO L87 Difference]: Start difference. First operand 14441 states and 37152 transitions. Second operand has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 18:10:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:23,040 INFO L93 Difference]: Finished difference Result 18821 states and 48492 transitions. [2021-06-05 18:10:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 18:10:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 238 [2021-06-05 18:10:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:23,058 INFO L225 Difference]: With dead ends: 18821 [2021-06-05 18:10:23,059 INFO L226 Difference]: Without dead ends: 16716 [2021-06-05 18:10:23,059 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 118.9ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-06-05 18:10:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2021-06-05 18:10:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 14396. [2021-06-05 18:10:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14396 states, 14394 states have (on average 2.5740586355425874) internal successors, (37051), 14395 states have internal predecessors, (37051), 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 18:10:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14396 states to 14396 states and 37051 transitions. [2021-06-05 18:10:23,280 INFO L78 Accepts]: Start accepts. Automaton has 14396 states and 37051 transitions. Word has length 238 [2021-06-05 18:10:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:23,281 INFO L482 AbstractCegarLoop]: Abstraction has 14396 states and 37051 transitions. [2021-06-05 18:10:23,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 18:10:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14396 states and 37051 transitions. [2021-06-05 18:10:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-06-05 18:10:23,295 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:23,296 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:23,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 18:10:23,496 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1923243252, now seen corresponding path program 6 times [2021-06-05 18:10:23,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:23,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490593947] [2021-06-05 18:10:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-06-05 18:10:23,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:23,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490593947] [2021-06-05 18:10:23,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490593947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:23,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504530651] [2021-06-05 18:10:23,627 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:23,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 18:10:23,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:23,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 18:10:23,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-06-05 18:10:24,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504530651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:24,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:24,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2021-06-05 18:10:24,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544301359] [2021-06-05 18:10:24,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:10:24,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:24,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:10:24,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:10:24,143 INFO L87 Difference]: Start difference. First operand 14396 states and 37051 transitions. Second operand has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 18:10:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:24,318 INFO L93 Difference]: Finished difference Result 15486 states and 39869 transitions. [2021-06-05 18:10:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 18:10:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 238 [2021-06-05 18:10:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:24,338 INFO L225 Difference]: With dead ends: 15486 [2021-06-05 18:10:24,338 INFO L226 Difference]: Without dead ends: 13906 [2021-06-05 18:10:24,339 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:10:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13906 states. [2021-06-05 18:10:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13906 to 11186. [2021-06-05 18:10:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11186 states, 11184 states have (on average 2.5691165951359083) internal successors, (28733), 11185 states have internal predecessors, (28733), 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 18:10:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11186 states to 11186 states and 28733 transitions. [2021-06-05 18:10:24,545 INFO L78 Accepts]: Start accepts. Automaton has 11186 states and 28733 transitions. Word has length 238 [2021-06-05 18:10:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:24,546 INFO L482 AbstractCegarLoop]: Abstraction has 11186 states and 28733 transitions. [2021-06-05 18:10:24,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 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 18:10:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 11186 states and 28733 transitions. [2021-06-05 18:10:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-06-05 18:10:24,557 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:24,557 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:24,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 18:10:24,757 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1840521012, now seen corresponding path program 7 times [2021-06-05 18:10:24,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:24,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355243684] [2021-06-05 18:10:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 256 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:24,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:24,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355243684] [2021-06-05 18:10:24,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355243684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:24,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747987808] [2021-06-05 18:10:24,887 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:25,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 18:10:25,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 256 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 18:10:25,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747987808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:25,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:25,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2021-06-05 18:10:25,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696751828] [2021-06-05 18:10:25,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 18:10:25,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 18:10:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:10:25,335 INFO L87 Difference]: Start difference. First operand 11186 states and 28733 transitions. Second operand has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 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 18:10:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:25,553 INFO L93 Difference]: Finished difference Result 16776 states and 43186 transitions. [2021-06-05 18:10:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:10:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 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 238 [2021-06-05 18:10:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:25,570 INFO L225 Difference]: With dead ends: 16776 [2021-06-05 18:10:25,571 INFO L226 Difference]: Without dead ends: 12006 [2021-06-05 18:10:25,571 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-06-05 18:10:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2021-06-05 18:10:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 9926. [2021-06-05 18:10:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9926 states, 9924 states have (on average 2.5758766626360337) internal successors, (25563), 9925 states have internal predecessors, (25563), 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 18:10:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9926 states to 9926 states and 25563 transitions. [2021-06-05 18:10:25,725 INFO L78 Accepts]: Start accepts. Automaton has 9926 states and 25563 transitions. Word has length 238 [2021-06-05 18:10:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:25,725 INFO L482 AbstractCegarLoop]: Abstraction has 9926 states and 25563 transitions. [2021-06-05 18:10:25,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 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 18:10:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9926 states and 25563 transitions. [2021-06-05 18:10:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-06-05 18:10:25,736 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:25,737 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:25,937 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 18:10:25,937 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1633509679, now seen corresponding path program 2 times [2021-06-05 18:10:25,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:25,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312858873] [2021-06-05 18:10:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 12 proven. 275 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-06-05 18:10:26,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:26,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312858873] [2021-06-05 18:10:26,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312858873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:26,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107441073] [2021-06-05 18:10:26,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:26,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 18:10:26,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:26,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 18:10:26,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 12 proven. 251 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-06-05 18:10:26,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107441073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:26,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:26,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2021-06-05 18:10:26,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093259121] [2021-06-05 18:10:26,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 18:10:26,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 18:10:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:10:26,568 INFO L87 Difference]: Start difference. First operand 9926 states and 25563 transitions. Second operand has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 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 18:10:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:26,742 INFO L93 Difference]: Finished difference Result 13996 states and 36100 transitions. [2021-06-05 18:10:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:10:26,743 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 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 272 [2021-06-05 18:10:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:26,751 INFO L225 Difference]: With dead ends: 13996 [2021-06-05 18:10:26,751 INFO L226 Difference]: Without dead ends: 8586 [2021-06-05 18:10:26,752 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 127.3ms TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2021-06-05 18:10:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8586 states. [2021-06-05 18:10:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8586 to 8586. [2021-06-05 18:10:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8586 states, 8584 states have (on average 2.570596458527493) internal successors, (22066), 8585 states have internal predecessors, (22066), 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 18:10:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8586 states to 8586 states and 22066 transitions. [2021-06-05 18:10:26,862 INFO L78 Accepts]: Start accepts. Automaton has 8586 states and 22066 transitions. Word has length 272 [2021-06-05 18:10:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:26,862 INFO L482 AbstractCegarLoop]: Abstraction has 8586 states and 22066 transitions. [2021-06-05 18:10:26,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 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 18:10:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8586 states and 22066 transitions. [2021-06-05 18:10:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-06-05 18:10:26,871 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:26,871 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:27,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:27,071 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash -937600713, now seen corresponding path program 3 times [2021-06-05 18:10:27,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:27,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234534221] [2021-06-05 18:10:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 12 proven. 252 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-06-05 18:10:27,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:27,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234534221] [2021-06-05 18:10:27,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234534221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:27,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497883536] [2021-06-05 18:10:27,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:27,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 18:10:27,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:27,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 18:10:27,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-06-05 18:10:27,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497883536] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:27,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 18:10:27,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-06-05 18:10:27,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123025433] [2021-06-05 18:10:27,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 18:10:27,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 18:10:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:10:27,599 INFO L87 Difference]: Start difference. First operand 8586 states and 22066 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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 18:10:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:27,710 INFO L93 Difference]: Finished difference Result 9936 states and 25547 transitions. [2021-06-05 18:10:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 18:10:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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 272 [2021-06-05 18:10:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:27,719 INFO L225 Difference]: With dead ends: 9936 [2021-06-05 18:10:27,720 INFO L226 Difference]: Without dead ends: 9406 [2021-06-05 18:10:27,720 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 123.8ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:10:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2021-06-05 18:10:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 9326. [2021-06-05 18:10:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9326 states, 9324 states have (on average 2.573251823251823) internal successors, (23993), 9325 states have internal predecessors, (23993), 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 18:10:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9326 states to 9326 states and 23993 transitions. [2021-06-05 18:10:27,812 INFO L78 Accepts]: Start accepts. Automaton has 9326 states and 23993 transitions. Word has length 272 [2021-06-05 18:10:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:27,813 INFO L482 AbstractCegarLoop]: Abstraction has 9326 states and 23993 transitions. [2021-06-05 18:10:27,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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 18:10:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9326 states and 23993 transitions. [2021-06-05 18:10:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-06-05 18:10:27,821 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:27,821 INFO L554 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:28,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:28,022 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1821126570, now seen corresponding path program 4 times [2021-06-05 18:10:28,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:28,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217603062] [2021-06-05 18:10:28,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 56 proven. 229 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-06-05 18:10:28,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:28,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217603062] [2021-06-05 18:10:28,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217603062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:28,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271843526] [2021-06-05 18:10:28,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:28,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 18:10:28,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 18:10:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 18:10:28,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 18:10:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 56 proven. 229 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-06-05 18:10:28,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271843526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 18:10:28,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 18:10:28,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 18:10:28,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394540601] [2021-06-05 18:10:28,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 18:10:28,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 18:10:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:10:28,608 INFO L87 Difference]: Start difference. First operand 9326 states and 23993 transitions. Second operand has 13 states, 13 states have (on average 22.23076923076923) internal successors, (289), 13 states have internal predecessors, (289), 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 18:10:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:28,745 INFO L93 Difference]: Finished difference Result 9126 states and 23477 transitions. [2021-06-05 18:10:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 18:10:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.23076923076923) internal successors, (289), 13 states have internal predecessors, (289), 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 306 [2021-06-05 18:10:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:28,746 INFO L225 Difference]: With dead ends: 9126 [2021-06-05 18:10:28,746 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 18:10:28,746 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 105.5ms TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:10:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 18:10:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 18:10:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 18:10:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 18:10:28,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2021-06-05 18:10:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:28,747 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 18:10:28,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 22.23076923076923) internal successors, (289), 13 states have internal predecessors, (289), 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 18:10:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 18:10:28,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:10:28,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 18:10:28,948 INFO L301 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/5) [2021-06-05 18:10:28,950 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 18:10:28,951 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:28,951 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:28,951 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:28,951 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:28,951 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:28,951 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:28,951 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:28,951 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 18:10:28,953 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 161 transitions, 344 flow [2021-06-05 18:10:29,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:29,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:10:29,335 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (2/5) [2021-06-05 18:10:29,335 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:29,335 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:29,335 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:29,336 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:29,336 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:29,336 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:29,336 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:29,336 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:29,336 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2Thread1of1ForFork1======== [2021-06-05 18:10:29,341 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 161 transitions, 344 flow [2021-06-05 18:10:29,647 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:10:29,667 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:29,667 INFO L554 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 18:10:29,667 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1138180608, now seen corresponding path program 1 times [2021-06-05 18:10:29,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:29,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563107953] [2021-06-05 18:10:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:29,694 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 18:10:29,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:29,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563107953] [2021-06-05 18:10:29,694 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563107953] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:29,694 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:29,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:10:29,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348588365] [2021-06-05 18:10:29,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:10:29,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:10:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:29,709 INFO L87 Difference]: Start difference. First operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 18:10:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:29,769 INFO L93 Difference]: Finished difference Result 11582 states and 31652 transitions. [2021-06-05 18:10:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:10:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 18:10:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:29,787 INFO L225 Difference]: With dead ends: 11582 [2021-06-05 18:10:29,788 INFO L226 Difference]: Without dead ends: 9843 [2021-06-05 18:10:29,788 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2021-06-05 18:10:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9843. [2021-06-05 18:10:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9840 states have (on average 2.7578252032520325) internal successors, (27137), 9842 states have internal predecessors, (27137), 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 18:10:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 27137 transitions. [2021-06-05 18:10:29,937 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 27137 transitions. Word has length 62 [2021-06-05 18:10:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:29,937 INFO L482 AbstractCegarLoop]: Abstraction has 9843 states and 27137 transitions. [2021-06-05 18:10:29,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 18:10:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 27137 transitions. [2021-06-05 18:10:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 18:10:29,942 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:29,943 INFO L554 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] [2021-06-05 18:10:29,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 18:10:29,943 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1845477142, now seen corresponding path program 1 times [2021-06-05 18:10:29,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:29,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003332725] [2021-06-05 18:10:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:29,963 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 18:10:29,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:29,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003332725] [2021-06-05 18:10:29,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003332725] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:29,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:29,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:10:29,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320468107] [2021-06-05 18:10:29,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:10:29,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:10:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:29,965 INFO L87 Difference]: Start difference. First operand 9843 states and 27137 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 18:10:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:29,991 INFO L93 Difference]: Finished difference Result 4431 states and 11394 transitions. [2021-06-05 18:10:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:10:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2021-06-05 18:10:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:29,997 INFO L225 Difference]: With dead ends: 4431 [2021-06-05 18:10:29,997 INFO L226 Difference]: Without dead ends: 4279 [2021-06-05 18:10:29,997 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2021-06-05 18:10:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 3101. [2021-06-05 18:10:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 3099 states have (on average 2.580187157147467) internal successors, (7996), 3100 states have internal predecessors, (7996), 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 18:10:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7996 transitions. [2021-06-05 18:10:30,056 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7996 transitions. Word has length 88 [2021-06-05 18:10:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:30,056 INFO L482 AbstractCegarLoop]: Abstraction has 3101 states and 7996 transitions. [2021-06-05 18:10:30,057 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 18:10:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7996 transitions. [2021-06-05 18:10:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 18:10:30,060 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:30,060 INFO L554 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] [2021-06-05 18:10:30,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 18:10:30,060 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:30,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1970420468, now seen corresponding path program 1 times [2021-06-05 18:10:30,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:30,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241344928] [2021-06-05 18:10:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:30,085 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 18:10:30,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:30,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241344928] [2021-06-05 18:10:30,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241344928] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:30,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:30,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:10:30,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911592891] [2021-06-05 18:10:30,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:10:30,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:10:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:30,086 INFO L87 Difference]: Start difference. First operand 3101 states and 7996 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 18:10:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:30,108 INFO L93 Difference]: Finished difference Result 3937 states and 10108 transitions. [2021-06-05 18:10:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:10:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2021-06-05 18:10:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:30,113 INFO L225 Difference]: With dead ends: 3937 [2021-06-05 18:10:30,113 INFO L226 Difference]: Without dead ends: 3937 [2021-06-05 18:10:30,113 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:10:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2021-06-05 18:10:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3595. [2021-06-05 18:10:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 2.572780406345672) internal successors, (9244), 3594 states have internal predecessors, (9244), 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 18:10:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 9244 transitions. [2021-06-05 18:10:30,171 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 9244 transitions. Word has length 89 [2021-06-05 18:10:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:30,172 INFO L482 AbstractCegarLoop]: Abstraction has 3595 states and 9244 transitions. [2021-06-05 18:10:30,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 18:10:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 9244 transitions. [2021-06-05 18:10:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-05 18:10:30,176 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:30,176 INFO L554 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] [2021-06-05 18:10:30,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 18:10:30,176 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1777911710, now seen corresponding path program 1 times [2021-06-05 18:10:30,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:30,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811605619] [2021-06-05 18:10:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:30,230 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 18:10:30,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:30,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811605619] [2021-06-05 18:10:30,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811605619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:30,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:30,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 18:10:30,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276360793] [2021-06-05 18:10:30,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 18:10:30,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:30,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 18:10:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 18:10:30,232 INFO L87 Difference]: Start difference. First operand 3595 states and 9244 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 18:10:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:30,325 INFO L93 Difference]: Finished difference Result 6035 states and 15529 transitions. [2021-06-05 18:10:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 18:10:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 98 [2021-06-05 18:10:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:30,331 INFO L225 Difference]: With dead ends: 6035 [2021-06-05 18:10:30,331 INFO L226 Difference]: Without dead ends: 6035 [2021-06-05 18:10:30,331 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:10:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2021-06-05 18:10:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 4989. [2021-06-05 18:10:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4989 states, 4987 states have (on average 2.574493683577301) internal successors, (12839), 4988 states have internal predecessors, (12839), 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 18:10:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 12839 transitions. [2021-06-05 18:10:30,395 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 12839 transitions. Word has length 98 [2021-06-05 18:10:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:30,395 INFO L482 AbstractCegarLoop]: Abstraction has 4989 states and 12839 transitions. [2021-06-05 18:10:30,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 18:10:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 12839 transitions. [2021-06-05 18:10:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 18:10:30,399 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:30,399 INFO L554 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] [2021-06-05 18:10:30,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 18:10:30,399 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1241846553, now seen corresponding path program 1 times [2021-06-05 18:10:30,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:30,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893635072] [2021-06-05 18:10:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:31,031 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 18:10:31,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:31,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893635072] [2021-06-05 18:10:31,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893635072] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:31,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:31,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-06-05 18:10:31,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075831619] [2021-06-05 18:10:31,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 18:10:31,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 18:10:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2021-06-05 18:10:31,033 INFO L87 Difference]: Start difference. First operand 4989 states and 12839 transitions. Second operand has 24 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 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 18:10:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:33,973 INFO L93 Difference]: Finished difference Result 13935 states and 36253 transitions. [2021-06-05 18:10:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 18:10:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 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 108 [2021-06-05 18:10:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:33,987 INFO L225 Difference]: With dead ends: 13935 [2021-06-05 18:10:33,987 INFO L226 Difference]: Without dead ends: 13935 [2021-06-05 18:10:33,988 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2294.1ms TimeCoverageRelationStatistics Valid=718, Invalid=3572, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 18:10:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13935 states. [2021-06-05 18:10:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13935 to 9050. [2021-06-05 18:10:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9050 states, 9048 states have (on average 2.6054376657824934) internal successors, (23574), 9049 states have internal predecessors, (23574), 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 18:10:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9050 states to 9050 states and 23574 transitions. [2021-06-05 18:10:34,120 INFO L78 Accepts]: Start accepts. Automaton has 9050 states and 23574 transitions. Word has length 108 [2021-06-05 18:10:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:34,120 INFO L482 AbstractCegarLoop]: Abstraction has 9050 states and 23574 transitions. [2021-06-05 18:10:34,120 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 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 18:10:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9050 states and 23574 transitions. [2021-06-05 18:10:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 18:10:34,125 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:34,125 INFO L554 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] [2021-06-05 18:10:34,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 18:10:34,125 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1436479409, now seen corresponding path program 2 times [2021-06-05 18:10:34,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:34,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930613948] [2021-06-05 18:10:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:34,799 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 18:10:34,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:34,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930613948] [2021-06-05 18:10:34,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930613948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:34,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:34,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 18:10:34,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123884204] [2021-06-05 18:10:34,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 18:10:34,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 18:10:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:10:34,800 INFO L87 Difference]: Start difference. First operand 9050 states and 23574 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 18:10:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:36,860 INFO L93 Difference]: Finished difference Result 18155 states and 47544 transitions. [2021-06-05 18:10:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 18:10:36,860 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 108 [2021-06-05 18:10:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:36,888 INFO L225 Difference]: With dead ends: 18155 [2021-06-05 18:10:36,888 INFO L226 Difference]: Without dead ends: 18155 [2021-06-05 18:10:36,889 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1634.7ms TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 18:10:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18155 states. [2021-06-05 18:10:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18155 to 10423. [2021-06-05 18:10:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10423 states, 10421 states have (on average 2.6332405719220806) internal successors, (27441), 10422 states have internal predecessors, (27441), 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 18:10:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10423 states to 10423 states and 27441 transitions. [2021-06-05 18:10:37,103 INFO L78 Accepts]: Start accepts. Automaton has 10423 states and 27441 transitions. Word has length 108 [2021-06-05 18:10:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:37,104 INFO L482 AbstractCegarLoop]: Abstraction has 10423 states and 27441 transitions. [2021-06-05 18:10:37,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 18:10:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 10423 states and 27441 transitions. [2021-06-05 18:10:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 18:10:37,114 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:37,114 INFO L554 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] [2021-06-05 18:10:37,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 18:10:37,114 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1171129703, now seen corresponding path program 3 times [2021-06-05 18:10:37,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:37,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210629124] [2021-06-05 18:10:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:37,430 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2021-06-05 18:10:37,857 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 18:10:37,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:37,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210629124] [2021-06-05 18:10:37,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210629124] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:37,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:37,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 18:10:37,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83986971] [2021-06-05 18:10:37,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 18:10:37,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:37,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 18:10:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2021-06-05 18:10:37,859 INFO L87 Difference]: Start difference. First operand 10423 states and 27441 transitions. Second operand has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 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 18:10:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:40,551 INFO L93 Difference]: Finished difference Result 25393 states and 66583 transitions. [2021-06-05 18:10:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 18:10:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 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 108 [2021-06-05 18:10:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:40,584 INFO L225 Difference]: With dead ends: 25393 [2021-06-05 18:10:40,584 INFO L226 Difference]: Without dead ends: 25393 [2021-06-05 18:10:40,585 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2034.9ms TimeCoverageRelationStatistics Valid=509, Invalid=3651, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 18:10:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25393 states. [2021-06-05 18:10:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25393 to 10481. [2021-06-05 18:10:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10481 states, 10479 states have (on average 2.6297356617997902) internal successors, (27557), 10480 states have internal predecessors, (27557), 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 18:10:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 27557 transitions. [2021-06-05 18:10:40,778 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 27557 transitions. Word has length 108 [2021-06-05 18:10:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:40,778 INFO L482 AbstractCegarLoop]: Abstraction has 10481 states and 27557 transitions. [2021-06-05 18:10:40,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 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 18:10:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 27557 transitions. [2021-06-05 18:10:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 18:10:40,788 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:40,788 INFO L554 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] [2021-06-05 18:10:40,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 18:10:40,788 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash -131145905, now seen corresponding path program 4 times [2021-06-05 18:10:40,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:40,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925662947] [2021-06-05 18:10:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:41,527 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 18:10:41,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:41,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925662947] [2021-06-05 18:10:41,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925662947] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:41,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:41,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 18:10:41,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477771060] [2021-06-05 18:10:41,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 18:10:41,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 18:10:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:10:41,529 INFO L87 Difference]: Start difference. First operand 10481 states and 27557 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 18:10:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:45,107 INFO L93 Difference]: Finished difference Result 21999 states and 57882 transitions. [2021-06-05 18:10:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-06-05 18:10:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 108 [2021-06-05 18:10:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:45,132 INFO L225 Difference]: With dead ends: 21999 [2021-06-05 18:10:45,133 INFO L226 Difference]: Without dead ends: 21999 [2021-06-05 18:10:45,134 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3022.4ms TimeCoverageRelationStatistics Valid=812, Invalid=4738, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 18:10:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21999 states. [2021-06-05 18:10:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21999 to 8939. [2021-06-05 18:10:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8939 states, 8937 states have (on average 2.605012867852747) internal successors, (23281), 8938 states have internal predecessors, (23281), 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 18:10:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8939 states to 8939 states and 23281 transitions. [2021-06-05 18:10:45,310 INFO L78 Accepts]: Start accepts. Automaton has 8939 states and 23281 transitions. Word has length 108 [2021-06-05 18:10:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:45,310 INFO L482 AbstractCegarLoop]: Abstraction has 8939 states and 23281 transitions. [2021-06-05 18:10:45,310 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 18:10:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8939 states and 23281 transitions. [2021-06-05 18:10:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-06-05 18:10:45,318 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:45,318 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:45,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 18:10:45,319 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 16614947, now seen corresponding path program 1 times [2021-06-05 18:10:45,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:45,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486982805] [2021-06-05 18:10:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 18:10:45,345 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 18:10:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 18:10:45,367 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 18:10:45,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 18:10:45,403 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 18:10:45,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 18:10:45,403 INFO L301 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/5) [2021-06-05 18:10:45,404 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:45,405 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:45,405 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:45,405 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:45,405 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:45,405 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:45,405 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:45,405 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:45,405 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1======== [2021-06-05 18:10:45,407 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 161 transitions, 344 flow [2021-06-05 18:10:45,605 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:45,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:10:45,635 INFO L301 ceAbstractionStarter]: Result for error location t1 was SAFE (4/5) [2021-06-05 18:10:45,636 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:45,636 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:45,636 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:45,636 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:45,636 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:45,636 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:45,636 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:45,636 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:45,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2======== [2021-06-05 18:10:45,638 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 161 transitions, 344 flow [2021-06-05 18:10:45,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 9835 states, 9831 states have (on average 2.8606448987895434) internal successors, (28123), 9834 states have internal predecessors, (28123), 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 18:10:45,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:10:45,838 INFO L301 ceAbstractionStarter]: Result for error location t2 was SAFE (5/5) [2021-06-05 18:10:45,839 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 18:10:45,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 06:10:45 BasicIcfg [2021-06-05 18:10:45,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 18:10:45,955 INFO L168 Benchmark]: Toolchain (without parser) took 41779.65 ms. Allocated memory was 373.3 MB in the beginning and 6.4 GB in the end (delta: 6.1 GB). Free memory was 335.2 MB in the beginning and 3.5 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,955 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 373.3 MB. Free memory was 353.9 MB in the beginning and 353.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.51 ms. Allocated memory is still 373.3 MB. Free memory was 335.0 MB in the beginning and 308.0 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.03 ms. Allocated memory is still 373.3 MB. Free memory was 308.0 MB in the beginning and 305.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 INFO L168 Benchmark]: Boogie Preprocessor took 26.26 ms. Allocated memory is still 373.3 MB. Free memory was 305.9 MB in the beginning and 303.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 INFO L168 Benchmark]: RCFGBuilder took 508.55 ms. Allocated memory is still 373.3 MB. Free memory was 303.8 MB in the beginning and 269.2 MB in the end (delta: 34.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 INFO L168 Benchmark]: TraceAbstraction took 40642.97 ms. Allocated memory was 373.3 MB in the beginning and 6.4 GB in the end (delta: 6.1 GB). Free memory was 269.2 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:45,956 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.15 ms. Allocated memory is still 373.3 MB. Free memory was 353.9 MB in the beginning and 353.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 548.51 ms. Allocated memory is still 373.3 MB. Free memory was 335.0 MB in the beginning and 308.0 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.03 ms. Allocated memory is still 373.3 MB. Free memory was 308.0 MB in the beginning and 305.9 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.26 ms. Allocated memory is still 373.3 MB. Free memory was 305.9 MB in the beginning and 303.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 508.55 ms. Allocated memory is still 373.3 MB. Free memory was 303.8 MB in the beginning and 269.2 MB in the end (delta: 34.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 40642.97 ms. Allocated memory was 373.3 MB in the beginning and 6.4 GB in the end (delta: 6.1 GB). Free memory was 269.2 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 941]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(5)]; VAL [arr={13:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={13:0}, m={14:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1021] 0 pthread_t id1, id2; VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1006] 2 int i; VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1007] 2 i=0 VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L990] 1 int i; VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L991] 1 unsigned int tmp; VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L992] 1 i=0 VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L23] COND FALSE 1 !(!cond) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L962] COND FALSE 1 !(top==(5)) VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L954] 1 return top; VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L969] 1 stack[get_top()] = x VAL [arr={13:0}, flag=0, m={14:0}, top=0] [L946] 1 top++ VAL [arr={13:0}, flag=0, m={14:0}, top=1] [L972] 1 return 0; VAL [arr={13:0}, flag=0, m={14:0}, top=1] [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arr={13:0}, flag=0, m={14:0}, top=1] [L999] 1 flag=(1) VAL [arr={13:0}, flag=1, m={14:0}, top=1] [L1010] COND TRUE 2 \read(flag) VAL [arr={13:0}, flag=1, m={14:0}, top=1] [L954] 2 return top; VAL [arr={13:0}, flag=1, m={14:0}, top=1] [L976] COND FALSE 2 !(get_top()==0) VAL [arr={13:0}, flag=1, m={14:0}, top=1] [L950] 2 top-- VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L954] 2 return top; VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L984] EXPR 2 stack[get_top()] VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L984] 2 return stack[get_top()]; VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L1007] 2 i++ VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L1010] COND TRUE 2 \read(flag) VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L954] 2 return top; VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L976] COND TRUE 2 get_top()==0 VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L979] 2 return (-2); VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L1012] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arr={13:0}, flag=1, m={14:0}, top=0] [L941] 2 reach_error() VAL [arr={13:0}, flag=1, m={14:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23446.9ms, OverallIterations: 20, TraceHistogramMax: 6, EmptinessCheckTime: 466.6ms, AutomataDifference: 4220.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 519.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4073 SDtfs, 9910 SDslu, 19619 SDs, 0 SdLazy, 1444 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 717.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3641 GetRequests, 3350 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1574.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18186occurred in iteration=13, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5189.1ms AutomataMinimizationTime, 20 MinimizatonAttempts, 41111 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 491.7ms SsaConstructionTime, 1403.1ms SatisfiabilityAnalysisTime, 6683.8ms InterpolantComputationTime, 6974 NumberOfCodeBlocks, 6767 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 6938 ConstructedInterpolants, 0 QuantifiedInterpolants, 18921 SizeOfPredicates, 126 NumberOfNonLiveVariables, 6379 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 2075/6852 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 383.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 70.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 313.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9835occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16067.5ms, OverallIterations: 9, TraceHistogramMax: 2, EmptinessCheckTime: 67.6ms, AutomataDifference: 11625.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 311.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2589 SDtfs, 6115 SDslu, 28255 SDs, 0 SdLazy, 8525 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3334.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3747 ImplicationChecksByTransitivity, 9036.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10481occurred in iteration=7, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1044.7ms AutomataMinimizationTime, 8 MinimizatonAttempts, 43155 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 14.8ms SsaConstructionTime, 153.9ms SatisfiabilityAnalysisTime, 2741.5ms InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 8369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1 with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 229.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 29.5ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 199.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9835occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2 with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 202.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 24.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 177.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9835occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...