/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 06:36:56,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 06:36:56,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 06:36:56,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 06:36:56,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 06:36:56,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 06:36:56,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 06:36:56,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 06:36:56,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 06:36:56,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 06:36:56,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 06:36:56,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 06:36:56,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 06:36:56,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 06:36:56,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 06:36:56,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 06:36:56,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 06:36:56,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 06:36:56,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 06:36:56,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 06:36:56,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 06:36:56,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 06:36:56,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 06:36:56,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 06:36:56,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 06:36:56,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 06:36:56,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 06:36:56,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 06:36:56,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 06:36:56,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 06:36:56,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 06:36:56,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 06:36:56,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 06:36:56,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 06:36:56,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 06:36:56,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 06:36:56,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 06:36:56,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 06:36:56,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 06:36:56,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 06:36:56,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 06:36:56,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-06 06:36:56,095 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 06:36:56,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 06:36:56,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 06:36:56,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 06:36:56,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 06:36:56,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 06:36:56,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 06:36:56,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 06:36:56,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 06:36:56,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 06:36:56,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 06:36:56,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 06:36:56,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 06:36:56,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 06:36:56,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 06:36:56,099 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-06 06:36:56,099 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 06:36:56,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 06:36:56,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 06:36:56,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 06:36:56,378 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 06:36:56,379 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 06:36:56,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-06 06:36:56,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc144ea14/7d461dd7c24b47b2a2dae9e7e12ee301/FLAG2a9871954 [2021-05-06 06:36:56,771 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 06:36:56,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-06 06:36:56,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc144ea14/7d461dd7c24b47b2a2dae9e7e12ee301/FLAG2a9871954 [2021-05-06 06:36:56,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc144ea14/7d461dd7c24b47b2a2dae9e7e12ee301 [2021-05-06 06:36:56,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 06:36:56,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-06 06:36:56,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 06:36:56,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 06:36:56,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 06:36:56,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:56,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669fc58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56, skipping insertion in model container [2021-05-06 06:36:56,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:56,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 06:36:56,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 06:36:56,920 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-06 06:36:56,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 06:36:56,939 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 06:36:56,954 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-06 06:36:56,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 06:36:56,992 INFO L208 MainTranslator]: Completed translation [2021-05-06 06:36:56,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56 WrapperNode [2021-05-06 06:36:56,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 06:36:56,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 06:36:57,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 06:36:57,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 06:36:57,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (1/1) ... [2021-05-06 06:36:57,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 06:36:57,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 06:36:57,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 06:36:57,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 06:36:57,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (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-05-06 06:36:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 06:36:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 06:36:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 06:36:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 06:36:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 06:36:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 06:36:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 06:36:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 06:36:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 06:36:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 06:36:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 06:36:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 06:36:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 06:36:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 06:36:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 06:36:57,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 06:36:57,303 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 06:36:57,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 06:36:57 BoogieIcfgContainer [2021-05-06 06:36:57,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 06:36:57,305 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-06 06:36:57,305 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-06 06:36:57,305 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-06 06:36:57,307 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 06:36:57" (1/1) ... [2021-05-06 06:36:57,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 06:36:57 BasicIcfg [2021-05-06 06:36:57,332 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-06 06:36:57,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 06:36:57,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 06:36:57,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 06:36:57,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 06:36:56" (1/4) ... [2021-05-06 06:36:57,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a4a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 06:36:57, skipping insertion in model container [2021-05-06 06:36:57,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 06:36:56" (2/4) ... [2021-05-06 06:36:57,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a4a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 06:36:57, skipping insertion in model container [2021-05-06 06:36:57,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 06:36:57" (3/4) ... [2021-05-06 06:36:57,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a4a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 06:36:57, skipping insertion in model container [2021-05-06 06:36:57,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 06:36:57" (4/4) ... [2021-05-06 06:36:57,336 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cJordan [2021-05-06 06:36:57,339 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-06 06:36:57,342 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 06:36:57,352 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 06:36:57,363 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 06:36:57,364 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-06 06:36:57,364 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-06 06:36:57,364 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 06:36:57,364 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 06:36:57,364 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 06:36:57,364 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 06:36:57,364 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 06:36:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 06:36:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 06:36:57,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:57,377 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:36:57,378 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2021-05-06 06:36:57,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:57,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763702861] [2021-05-06 06:36:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:57,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:57,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763702861] [2021-05-06 06:36:57,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763702861] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:57,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:36:57,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 06:36:57,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314252712] [2021-05-06 06:36:57,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 06:36:57,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 06:36:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 06:36:57,556 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:57,604 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2021-05-06 06:36:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 06:36:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-06 06:36:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:57,610 INFO L225 Difference]: With dead ends: 27 [2021-05-06 06:36:57,610 INFO L226 Difference]: Without dead ends: 27 [2021-05-06 06:36:57,611 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 06:36:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-06 06:36:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-06 06:36:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 06:36:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-06 06:36:57,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-06 06:36:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-06 06:36:57,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-06 06:36:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 06:36:57,631 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:57,631 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:36:57,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 06:36:57,632 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2021-05-06 06:36:57,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:57,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094125342] [2021-05-06 06:36:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:57,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:57,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094125342] [2021-05-06 06:36:57,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094125342] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:57,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:36:57,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 06:36:57,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078706386] [2021-05-06 06:36:57,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 06:36:57,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 06:36:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-06 06:36:57,797 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:36:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:57,933 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-05-06 06:36:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 06:36:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-06 06:36:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:57,934 INFO L225 Difference]: With dead ends: 31 [2021-05-06 06:36:57,934 INFO L226 Difference]: Without dead ends: 31 [2021-05-06 06:36:57,935 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-06 06:36:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-06 06:36:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-06 06:36:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 06:36:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-06 06:36:57,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-06 06:36:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:57,939 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-06 06:36:57,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:36:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-06 06:36:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 06:36:57,940 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:57,940 INFO L523 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] [2021-05-06 06:36:57,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 06:36:57,940 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:57,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2021-05-06 06:36:57,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:57,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153202167] [2021-05-06 06:36:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:57,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 06:36:58,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:58,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153202167] [2021-05-06 06:36:58,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153202167] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:58,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:36:58,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 06:36:58,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548881811] [2021-05-06 06:36:58,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 06:36:58,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 06:36:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 06:36:58,010 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:58,066 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-05-06 06:36:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 06:36:58,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-06 06:36:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:58,068 INFO L225 Difference]: With dead ends: 33 [2021-05-06 06:36:58,068 INFO L226 Difference]: Without dead ends: 33 [2021-05-06 06:36:58,068 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 06:36:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-06 06:36:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-05-06 06:36:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 06:36:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-05-06 06:36:58,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2021-05-06 06:36:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:58,073 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-05-06 06:36:58,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-05-06 06:36:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 06:36:58,073 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:58,073 INFO L523 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] [2021-05-06 06:36:58,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 06:36:58,074 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2021-05-06 06:36:58,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:58,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145002021] [2021-05-06 06:36:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 06:36:58,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:58,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145002021] [2021-05-06 06:36:58,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145002021] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:58,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:36:58,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 06:36:58,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165916423] [2021-05-06 06:36:58,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 06:36:58,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 06:36:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 06:36:58,178 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:36:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:58,277 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2021-05-06 06:36:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 06:36:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-05-06 06:36:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:58,280 INFO L225 Difference]: With dead ends: 40 [2021-05-06 06:36:58,280 INFO L226 Difference]: Without dead ends: 40 [2021-05-06 06:36:58,280 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-06 06:36:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-06 06:36:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-06 06:36:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 06:36:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-05-06 06:36:58,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-05-06 06:36:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:58,292 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-05-06 06:36:58,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:36:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-05-06 06:36:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 06:36:58,294 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:58,294 INFO L523 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] [2021-05-06 06:36:58,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 06:36:58,294 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2021-05-06 06:36:58,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:58,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529139997] [2021-05-06 06:36:58,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:58,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:58,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529139997] [2021-05-06 06:36:58,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529139997] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:36:58,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297188610] [2021-05-06 06:36:58,386 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-05-06 06:36:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 06:36:58,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:36:58,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:58,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:58,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:58,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297188610] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:36:58,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:36:58,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-05-06 06:36:58,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479097398] [2021-05-06 06:36:58,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 06:36:58,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 06:36:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 06:36:58,567 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:36:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:58,688 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-05-06 06:36:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 06:36:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-06 06:36:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:58,689 INFO L225 Difference]: With dead ends: 51 [2021-05-06 06:36:58,690 INFO L226 Difference]: Without dead ends: 51 [2021-05-06 06:36:58,690 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-06 06:36:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-06 06:36:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2021-05-06 06:36:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 06:36:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2021-05-06 06:36:58,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 24 [2021-05-06 06:36:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:58,693 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2021-05-06 06:36:58,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:36:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2021-05-06 06:36:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 06:36:58,694 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:58,694 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:36:58,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:36:58,909 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 358048934, now seen corresponding path program 2 times [2021-05-06 06:36:58,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:58,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982843548] [2021-05-06 06:36:58,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:58,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:58,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982843548] [2021-05-06 06:36:58,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982843548] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:36:58,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605164834] [2021-05-06 06:36:58,998 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-05-06 06:36:59,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:36:59,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:36:59,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 06:36:59,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:36:59,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 06:36:59,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605164834] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:59,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 06:36:59,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-05-06 06:36:59,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501679937] [2021-05-06 06:36:59,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 06:36:59,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 06:36:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-06 06:36:59,169 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:59,245 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2021-05-06 06:36:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 06:36:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-06 06:36:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:59,249 INFO L225 Difference]: With dead ends: 88 [2021-05-06 06:36:59,249 INFO L226 Difference]: Without dead ends: 88 [2021-05-06 06:36:59,249 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-06 06:36:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-06 06:36:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2021-05-06 06:36:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 06:36:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2021-05-06 06:36:59,266 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 27 [2021-05-06 06:36:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:59,266 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2021-05-06 06:36:59,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2021-05-06 06:36:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 06:36:59,266 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:59,267 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:36:59,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:36:59,467 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:59,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash -131867578, now seen corresponding path program 1 times [2021-05-06 06:36:59,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:59,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015987007] [2021-05-06 06:36:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 06:36:59,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:59,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015987007] [2021-05-06 06:36:59,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015987007] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:36:59,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:36:59,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 06:36:59,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553053679] [2021-05-06 06:36:59,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 06:36:59,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 06:36:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 06:36:59,519 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:59,568 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2021-05-06 06:36:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 06:36:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-06 06:36:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:59,570 INFO L225 Difference]: With dead ends: 97 [2021-05-06 06:36:59,570 INFO L226 Difference]: Without dead ends: 97 [2021-05-06 06:36:59,570 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 06:36:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-06 06:36:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-05-06 06:36:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 06:36:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-05-06 06:36:59,585 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 27 [2021-05-06 06:36:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:59,585 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-05-06 06:36:59,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:36:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-05-06 06:36:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-06 06:36:59,590 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:59,590 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-06 06:36:59,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 06:36:59,590 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:36:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:36:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1708732761, now seen corresponding path program 1 times [2021-05-06 06:36:59,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:36:59,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830449204] [2021-05-06 06:36:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:36:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:36:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:36:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:59,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:36:59,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830449204] [2021-05-06 06:36:59,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830449204] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:36:59,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532946168] [2021-05-06 06:36:59,646 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-05-06 06:36:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:36:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-06 06:36:59,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:36:59,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:36:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:36:59,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532946168] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:36:59,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:36:59,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-05-06 06:36:59,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501129379] [2021-05-06 06:36:59,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 06:36:59,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:36:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 06:36:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 06:36:59,765 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:36:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:36:59,886 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-05-06 06:36:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 06:36:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-05-06 06:36:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:36:59,887 INFO L225 Difference]: With dead ends: 117 [2021-05-06 06:36:59,887 INFO L226 Difference]: Without dead ends: 117 [2021-05-06 06:36:59,887 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-05-06 06:36:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-06 06:36:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2021-05-06 06:36:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.326086956521739) internal successors, (122), 93 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 06:36:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-05-06 06:36:59,891 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 28 [2021-05-06 06:36:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:36:59,891 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-05-06 06:36:59,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:36:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-05-06 06:36:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 06:36:59,891 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:36:59,891 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-06 06:37:00,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:00,108 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1076023237, now seen corresponding path program 2 times [2021-05-06 06:37:00,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:00,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357810518] [2021-05-06 06:37:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:00,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:00,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:00,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:00,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357810518] [2021-05-06 06:37:00,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357810518] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:00,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651402879] [2021-05-06 06:37:00,252 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 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-05-06 06:37:00,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:00,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:00,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-06 06:37:00,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:00,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:00,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:00,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:00,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-06 06:37:00,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651402879] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:00,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:00,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-05-06 06:37:00,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741725689] [2021-05-06 06:37:00,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 06:37:00,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 06:37:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-06 06:37:00,376 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-06 06:37:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:00,898 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2021-05-06 06:37:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-06 06:37:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-05-06 06:37:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:00,900 INFO L225 Difference]: With dead ends: 225 [2021-05-06 06:37:00,900 INFO L226 Difference]: Without dead ends: 225 [2021-05-06 06:37:00,900 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 404.9ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-05-06 06:37:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-06 06:37:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2021-05-06 06:37:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 157 states have (on average 1.305732484076433) internal successors, (205), 158 states have internal predecessors, (205), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2021-05-06 06:37:00,905 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 31 [2021-05-06 06:37:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:00,905 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2021-05-06 06:37:00,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-06 06:37:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2021-05-06 06:37:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 06:37:00,906 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:00,906 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-06 06:37:01,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:01,109 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140216, now seen corresponding path program 1 times [2021-05-06 06:37:01,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:01,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912980136] [2021-05-06 06:37:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:01,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:01,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912980136] [2021-05-06 06:37:01,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912980136] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:01,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871354777] [2021-05-06 06:37:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05-06 06:37:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 06:37:01,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:01,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:01,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871354777] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:01,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:01,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-06 06:37:01,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364873192] [2021-05-06 06:37:01,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 06:37:01,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 06:37:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-06 06:37:01,324 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:01,461 INFO L93 Difference]: Finished difference Result 211 states and 269 transitions. [2021-05-06 06:37:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 06:37:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2021-05-06 06:37:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:01,462 INFO L225 Difference]: With dead ends: 211 [2021-05-06 06:37:01,462 INFO L226 Difference]: Without dead ends: 211 [2021-05-06 06:37:01,463 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 102.0ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-06 06:37:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-06 06:37:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2021-05-06 06:37:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 178 states have internal predecessors, (227), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2021-05-06 06:37:01,468 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 34 [2021-05-06 06:37:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:01,470 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2021-05-06 06:37:01,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2021-05-06 06:37:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-06 06:37:01,471 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:01,471 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-06 06:37:01,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-06 06:37:01,688 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash 210118746, now seen corresponding path program 2 times [2021-05-06 06:37:01,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:01,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449303152] [2021-05-06 06:37:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:01,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449303152] [2021-05-06 06:37:01,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449303152] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133465284] [2021-05-06 06:37:01,771 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 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-05-06 06:37:01,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:01,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:01,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-06 06:37:01,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:01,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:01,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133465284] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:01,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:01,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-05-06 06:37:01,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546573361] [2021-05-06 06:37:01,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 06:37:01,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 06:37:01,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2021-05-06 06:37:01,934 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:02,110 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2021-05-06 06:37:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 06:37:02,111 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-05-06 06:37:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:02,112 INFO L225 Difference]: With dead ends: 239 [2021-05-06 06:37:02,112 INFO L226 Difference]: Without dead ends: 239 [2021-05-06 06:37:02,113 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 111.5ms TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-05-06 06:37:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-05-06 06:37:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2021-05-06 06:37:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 201 states have (on average 1.2786069651741294) internal successors, (257), 202 states have internal predecessors, (257), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2021-05-06 06:37:02,117 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 37 [2021-05-06 06:37:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:02,117 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2021-05-06 06:37:02,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2021-05-06 06:37:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-06 06:37:02,118 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:02,118 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:02,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:02,329 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash -856307784, now seen corresponding path program 3 times [2021-05-06 06:37:02,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:02,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713590252] [2021-05-06 06:37:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:02,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:02,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713590252] [2021-05-06 06:37:02,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713590252] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:02,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204285460] [2021-05-06 06:37:02,414 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-05-06 06:37:02,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 06:37:02,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:02,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 06:37:02,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:02,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-05-06 06:37:02,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204285460] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:37:02,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 06:37:02,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-05-06 06:37:02,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146604183] [2021-05-06 06:37:02,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 06:37:02,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 06:37:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-06 06:37:02,554 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:02,598 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2021-05-06 06:37:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 06:37:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-05-06 06:37:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:02,600 INFO L225 Difference]: With dead ends: 211 [2021-05-06 06:37:02,600 INFO L226 Difference]: Without dead ends: 211 [2021-05-06 06:37:02,600 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 91.5ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-06 06:37:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-06 06:37:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2021-05-06 06:37:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 196 states have internal predecessors, (245), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2021-05-06 06:37:02,606 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 40 [2021-05-06 06:37:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:02,606 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2021-05-06 06:37:02,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2021-05-06 06:37:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-06 06:37:02,607 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:02,607 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:02,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:02,811 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -825287977, now seen corresponding path program 1 times [2021-05-06 06:37:02,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:02,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236987145] [2021-05-06 06:37:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:02,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:02,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236987145] [2021-05-06 06:37:02,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236987145] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:02,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505857569] [2021-05-06 06:37:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05-06 06:37:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:02,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-06 06:37:02,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:02,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:02,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:03,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505857569] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:03,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:03,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-05-06 06:37:03,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880061865] [2021-05-06 06:37:03,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-06 06:37:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-06 06:37:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2021-05-06 06:37:03,110 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:03,275 INFO L93 Difference]: Finished difference Result 257 states and 321 transitions. [2021-05-06 06:37:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-06 06:37:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2021-05-06 06:37:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:03,277 INFO L225 Difference]: With dead ends: 257 [2021-05-06 06:37:03,277 INFO L226 Difference]: Without dead ends: 257 [2021-05-06 06:37:03,277 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 138.7ms TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2021-05-06 06:37:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-06 06:37:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2021-05-06 06:37:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 220 states have internal predecessors, (275), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2021-05-06 06:37:03,282 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 40 [2021-05-06 06:37:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:03,282 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2021-05-06 06:37:03,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2021-05-06 06:37:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-06 06:37:03,284 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:03,284 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:03,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-06 06:37:03,493 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash -202872805, now seen corresponding path program 2 times [2021-05-06 06:37:03,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:03,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640591926] [2021-05-06 06:37:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:03,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:03,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:03,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:03,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640591926] [2021-05-06 06:37:03,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640591926] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:03,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402118893] [2021-05-06 06:37:03,595 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 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-05-06 06:37:03,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:03,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:03,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-06 06:37:03,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:03,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:03,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402118893] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:03,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:03,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-06 06:37:03,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351754555] [2021-05-06 06:37:03,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-06 06:37:03,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-06 06:37:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-06 06:37:03,822 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:04,022 INFO L93 Difference]: Finished difference Result 281 states and 351 transitions. [2021-05-06 06:37:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 06:37:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2021-05-06 06:37:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:04,024 INFO L225 Difference]: With dead ends: 281 [2021-05-06 06:37:04,024 INFO L226 Difference]: Without dead ends: 281 [2021-05-06 06:37:04,024 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 165.6ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-06 06:37:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-06 06:37:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2021-05-06 06:37:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 244 states have internal predecessors, (305), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 322 transitions. [2021-05-06 06:37:04,031 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 322 transitions. Word has length 43 [2021-05-06 06:37:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:04,031 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 322 transitions. [2021-05-06 06:37:04,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 322 transitions. [2021-05-06 06:37:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-06 06:37:04,032 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:04,032 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:04,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:04,238 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 793699415, now seen corresponding path program 3 times [2021-05-06 06:37:04,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:04,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896257180] [2021-05-06 06:37:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:04,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:04,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:04,350 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:04,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896257180] [2021-05-06 06:37:04,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896257180] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:04,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753430593] [2021-05-06 06:37:04,351 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 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-05-06 06:37:04,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 06:37:04,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:04,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-06 06:37:04,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:04,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-05-06 06:37:04,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753430593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:37:04,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 06:37:04,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2021-05-06 06:37:04,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191307711] [2021-05-06 06:37:04,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 06:37:04,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 06:37:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-05-06 06:37:04,594 INFO L87 Difference]: Start difference. First operand 258 states and 322 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:04,675 INFO L93 Difference]: Finished difference Result 339 states and 417 transitions. [2021-05-06 06:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 06:37:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-05-06 06:37:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:04,676 INFO L225 Difference]: With dead ends: 339 [2021-05-06 06:37:04,677 INFO L226 Difference]: Without dead ends: 339 [2021-05-06 06:37:04,678 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 145.9ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-06 06:37:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-05-06 06:37:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-05-06 06:37:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 06:37:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2021-05-06 06:37:04,685 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 46 [2021-05-06 06:37:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:04,685 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2021-05-06 06:37:04,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2021-05-06 06:37:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-06 06:37:04,686 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:04,686 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:04,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-05-06 06:37:04,903 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1458701912, now seen corresponding path program 1 times [2021-05-06 06:37:04,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:04,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29504065] [2021-05-06 06:37:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:04,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:05,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:05,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:05,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29504065] [2021-05-06 06:37:05,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29504065] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:05,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661342132] [2021-05-06 06:37:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05-06 06:37:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:05,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-06 06:37:05,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:05,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:05,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661342132] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:05,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:05,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-05-06 06:37:05,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978617243] [2021-05-06 06:37:05,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-06 06:37:05,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-06 06:37:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-05-06 06:37:05,229 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:05,721 INFO L93 Difference]: Finished difference Result 496 states and 611 transitions. [2021-05-06 06:37:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-06 06:37:05,725 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2021-05-06 06:37:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:05,727 INFO L225 Difference]: With dead ends: 496 [2021-05-06 06:37:05,727 INFO L226 Difference]: Without dead ends: 496 [2021-05-06 06:37:05,728 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 380.8ms TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2021-05-06 06:37:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-05-06 06:37:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2021-05-06 06:37:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 424 states have (on average 1.2429245283018868) internal successors, (527), 429 states have internal predecessors, (527), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 06:37:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 558 transitions. [2021-05-06 06:37:05,739 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 558 transitions. Word has length 46 [2021-05-06 06:37:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:05,739 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 558 transitions. [2021-05-06 06:37:05,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 558 transitions. [2021-05-06 06:37:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 06:37:05,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:05,740 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:05,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-06 06:37:05,945 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1517654139, now seen corresponding path program 2 times [2021-05-06 06:37:05,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:05,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3457110] [2021-05-06 06:37:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:06,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:06,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:06,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:06,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3457110] [2021-05-06 06:37:06,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3457110] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:06,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625084026] [2021-05-06 06:37:06,361 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 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-05-06 06:37:06,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:06,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:06,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 06:37:06,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:06,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:06,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625084026] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:06,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:06,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 06:37:06,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851468548] [2021-05-06 06:37:06,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 06:37:06,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 06:37:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-05-06 06:37:06,730 INFO L87 Difference]: Start difference. First operand 451 states and 558 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:07,133 INFO L93 Difference]: Finished difference Result 652 states and 809 transitions. [2021-05-06 06:37:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-06 06:37:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-05-06 06:37:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:07,137 INFO L225 Difference]: With dead ends: 652 [2021-05-06 06:37:07,138 INFO L226 Difference]: Without dead ends: 652 [2021-05-06 06:37:07,138 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 559.3ms TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2021-05-06 06:37:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-05-06 06:37:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 458. [2021-05-06 06:37:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 431 states have (on average 1.2552204176334107) internal successors, (541), 436 states have internal predecessors, (541), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 06:37:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 572 transitions. [2021-05-06 06:37:07,151 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 572 transitions. Word has length 49 [2021-05-06 06:37:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:07,151 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 572 transitions. [2021-05-06 06:37:07,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 06:37:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 572 transitions. [2021-05-06 06:37:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 06:37:07,152 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:07,152 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:07,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-06 06:37:07,369 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1433960443, now seen corresponding path program 1 times [2021-05-06 06:37:07,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:07,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129592891] [2021-05-06 06:37:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-06 06:37:07,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:07,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129592891] [2021-05-06 06:37:07,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129592891] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:37:07,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 06:37:07,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 06:37:07,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456511827] [2021-05-06 06:37:07,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 06:37:07,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:07,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 06:37:07,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 06:37:07,415 INFO L87 Difference]: Start difference. First operand 458 states and 572 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:37:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:07,506 INFO L93 Difference]: Finished difference Result 624 states and 784 transitions. [2021-05-06 06:37:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 06:37:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-06 06:37:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:07,510 INFO L225 Difference]: With dead ends: 624 [2021-05-06 06:37:07,510 INFO L226 Difference]: Without dead ends: 624 [2021-05-06 06:37:07,510 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-06 06:37:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-05-06 06:37:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 493. [2021-05-06 06:37:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 06:37:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-06 06:37:07,521 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 49 [2021-05-06 06:37:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:07,521 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-06 06:37:07,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 06:37:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-06 06:37:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-06 06:37:07,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:07,522 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:07,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 06:37:07,522 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1121824632, now seen corresponding path program 3 times [2021-05-06 06:37:07,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:07,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129226101] [2021-05-06 06:37:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:07,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:07,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129226101] [2021-05-06 06:37:07,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129226101] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:07,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335268304] [2021-05-06 06:37:07,653 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 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-05-06 06:37:07,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 06:37:07,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:07,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-06 06:37:07,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:07,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-06 06:37:07,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335268304] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:37:07,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 06:37:07,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-05-06 06:37:07,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552772644] [2021-05-06 06:37:07,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 06:37:07,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 06:37:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-05-06 06:37:07,899 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:07,970 INFO L93 Difference]: Finished difference Result 502 states and 627 transitions. [2021-05-06 06:37:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 06:37:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2021-05-06 06:37:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:07,972 INFO L225 Difference]: With dead ends: 502 [2021-05-06 06:37:07,972 INFO L226 Difference]: Without dead ends: 502 [2021-05-06 06:37:07,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-05-06 06:37:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-05-06 06:37:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 493. [2021-05-06 06:37:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 06:37:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-06 06:37:07,982 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 52 [2021-05-06 06:37:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:07,982 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-06 06:37:07,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-06 06:37:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-06 06:37:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-06 06:37:07,983 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:07,983 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 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] [2021-05-06 06:37:08,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-05-06 06:37:08,193 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash 225679135, now seen corresponding path program 1 times [2021-05-06 06:37:08,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:08,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251609966] [2021-05-06 06:37:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:08,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:08,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:08,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-06 06:37:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 265 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-05-06 06:37:08,300 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:08,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251609966] [2021-05-06 06:37:08,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251609966] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:08,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528465845] [2021-05-06 06:37:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05-06 06:37:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-06 06:37:08,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:08,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,508 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-05-06 06:37:08,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528465845] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:08,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:08,558 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-06 06:37:08,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740016289] [2021-05-06 06:37:08,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 06:37:08,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 06:37:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-06 06:37:08,559 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:08,794 INFO L93 Difference]: Finished difference Result 559 states and 696 transitions. [2021-05-06 06:37:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 06:37:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 87 [2021-05-06 06:37:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:08,796 INFO L225 Difference]: With dead ends: 559 [2021-05-06 06:37:08,796 INFO L226 Difference]: Without dead ends: 559 [2021-05-06 06:37:08,796 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 186.3ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-06 06:37:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-05-06 06:37:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 524. [2021-05-06 06:37:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 496 states have (on average 1.2459677419354838) internal successors, (618), 501 states have internal predecessors, (618), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 06:37:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 651 transitions. [2021-05-06 06:37:08,805 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 651 transitions. Word has length 87 [2021-05-06 06:37:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:08,806 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 651 transitions. [2021-05-06 06:37:08,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 651 transitions. [2021-05-06 06:37:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-06 06:37:08,807 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:08,807 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 18, 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] [2021-05-06 06:37:09,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:09,025 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1359158039, now seen corresponding path program 2 times [2021-05-06 06:37:09,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:09,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141159625] [2021-05-06 06:37:09,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:09,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:09,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:09,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 06:37:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-05-06 06:37:09,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:09,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141159625] [2021-05-06 06:37:09,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141159625] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:09,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679006099] [2021-05-06 06:37:09,152 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 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-05-06 06:37:09,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:09,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:09,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 06:37:09,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:09,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-05-06 06:37:09,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679006099] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:09,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:09,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 06:37:09,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806449959] [2021-05-06 06:37:09,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 06:37:09,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 06:37:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-06 06:37:09,463 INFO L87 Difference]: Start difference. First operand 524 states and 651 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:09,731 INFO L93 Difference]: Finished difference Result 612 states and 759 transitions. [2021-05-06 06:37:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 06:37:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 93 [2021-05-06 06:37:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:09,734 INFO L225 Difference]: With dead ends: 612 [2021-05-06 06:37:09,734 INFO L226 Difference]: Without dead ends: 612 [2021-05-06 06:37:09,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 225.8ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-06 06:37:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-05-06 06:37:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 569. [2021-05-06 06:37:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 541 states have (on average 1.243992606284658) internal successors, (673), 546 states have internal predecessors, (673), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 06:37:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 706 transitions. [2021-05-06 06:37:09,744 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 706 transitions. Word has length 93 [2021-05-06 06:37:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 706 transitions. [2021-05-06 06:37:09,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 706 transitions. [2021-05-06 06:37:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-06 06:37:09,745 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:09,745 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 20, 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] [2021-05-06 06:37:09,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-05-06 06:37:09,961 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1567764767, now seen corresponding path program 3 times [2021-05-06 06:37:09,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:09,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786531303] [2021-05-06 06:37:09,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:10,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:10,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:10,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 06:37:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-05-06 06:37:10,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:10,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786531303] [2021-05-06 06:37:10,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786531303] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:10,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171781202] [2021-05-06 06:37:10,090 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 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-05-06 06:37:10,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 06:37:10,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:10,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 06:37:10,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:10,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,360 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 33 proven. 392 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-05-06 06:37:10,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171781202] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:10,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:10,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2021-05-06 06:37:10,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898407156] [2021-05-06 06:37:10,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 06:37:10,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 06:37:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-05-06 06:37:10,404 INFO L87 Difference]: Start difference. First operand 569 states and 706 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:11,573 INFO L93 Difference]: Finished difference Result 973 states and 1204 transitions. [2021-05-06 06:37:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-06 06:37:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 99 [2021-05-06 06:37:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:11,580 INFO L225 Difference]: With dead ends: 973 [2021-05-06 06:37:11,580 INFO L226 Difference]: Without dead ends: 973 [2021-05-06 06:37:11,581 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 890.4ms TimeCoverageRelationStatistics Valid=944, Invalid=3612, Unknown=0, NotChecked=0, Total=4556 [2021-05-06 06:37:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-05-06 06:37:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 916. [2021-05-06 06:37:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 877 states have (on average 1.242873432155074) internal successors, (1090), 884 states have internal predecessors, (1090), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 06:37:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1137 transitions. [2021-05-06 06:37:11,594 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1137 transitions. Word has length 99 [2021-05-06 06:37:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:11,594 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1137 transitions. [2021-05-06 06:37:11,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1137 transitions. [2021-05-06 06:37:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-06 06:37:11,595 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:11,595 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 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] [2021-05-06 06:37:11,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:11,809 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1915685814, now seen corresponding path program 1 times [2021-05-06 06:37:11,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:11,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650676072] [2021-05-06 06:37:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:11,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:11,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:11,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-05-06 06:37:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 44 proven. 630 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-05-06 06:37:11,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:11,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650676072] [2021-05-06 06:37:11,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650676072] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:11,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983308183] [2021-05-06 06:37:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:12,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-06 06:37:12,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:12,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-05-06 06:37:12,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983308183] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:12,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:12,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-05-06 06:37:12,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747841049] [2021-05-06 06:37:12,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-06 06:37:12,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-06 06:37:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2021-05-06 06:37:12,303 INFO L87 Difference]: Start difference. First operand 916 states and 1137 transitions. Second operand has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:12,534 INFO L93 Difference]: Finished difference Result 1026 states and 1272 transitions. [2021-05-06 06:37:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 06:37:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 105 [2021-05-06 06:37:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:12,539 INFO L225 Difference]: With dead ends: 1026 [2021-05-06 06:37:12,539 INFO L226 Difference]: Without dead ends: 1026 [2021-05-06 06:37:12,539 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 260.4ms TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2021-05-06 06:37:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-05-06 06:37:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 964. [2021-05-06 06:37:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 925 states have (on average 1.241081081081081) internal successors, (1148), 932 states have internal predecessors, (1148), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 06:37:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1195 transitions. [2021-05-06 06:37:12,555 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1195 transitions. Word has length 105 [2021-05-06 06:37:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:12,556 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1195 transitions. [2021-05-06 06:37:12,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1195 transitions. [2021-05-06 06:37:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-06 06:37:12,557 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:12,557 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 13, 13, 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] [2021-05-06 06:37:12,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-05-06 06:37:12,774 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash 668267967, now seen corresponding path program 2 times [2021-05-06 06:37:12,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:12,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053829814] [2021-05-06 06:37:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:12,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:12,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:12,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 06:37:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 47 proven. 741 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-05-06 06:37:12,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:12,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053829814] [2021-05-06 06:37:12,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053829814] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:12,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175877028] [2021-05-06 06:37:12,935 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:12,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:12,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:12,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-06 06:37:12,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:13,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-05-06 06:37:13,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175877028] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:13,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:13,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-06 06:37:13,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642857596] [2021-05-06 06:37:13,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-06 06:37:13,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-06 06:37:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-06 06:37:13,289 INFO L87 Difference]: Start difference. First operand 964 states and 1195 transitions. Second operand has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:13,496 INFO L93 Difference]: Finished difference Result 1097 states and 1358 transitions. [2021-05-06 06:37:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 06:37:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 111 [2021-05-06 06:37:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:13,498 INFO L225 Difference]: With dead ends: 1097 [2021-05-06 06:37:13,498 INFO L226 Difference]: Without dead ends: 1097 [2021-05-06 06:37:13,499 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 283.6ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 06:37:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-05-06 06:37:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1033. [2021-05-06 06:37:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 994 states have (on average 1.2394366197183098) internal successors, (1232), 1001 states have internal predecessors, (1232), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 06:37:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1279 transitions. [2021-05-06 06:37:13,511 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1279 transitions. Word has length 111 [2021-05-06 06:37:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:13,511 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1279 transitions. [2021-05-06 06:37:13,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1279 transitions. [2021-05-06 06:37:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-06 06:37:13,512 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:13,512 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 14, 14, 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] [2021-05-06 06:37:13,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-05-06 06:37:13,731 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1949635370, now seen corresponding path program 3 times [2021-05-06 06:37:13,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:13,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538383898] [2021-05-06 06:37:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:13,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:13,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:13,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 06:37:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 50 proven. 861 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-05-06 06:37:13,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:13,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538383898] [2021-05-06 06:37:13,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538383898] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:13,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875908031] [2021-05-06 06:37:13,901 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:13,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-06 06:37:13,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:13,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-06 06:37:13,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:14,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:14,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:14,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 624 proven. 41 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-05-06 06:37:14,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875908031] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:14,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:14,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 24 [2021-05-06 06:37:14,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227665390] [2021-05-06 06:37:14,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 06:37:14,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 06:37:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2021-05-06 06:37:14,158 INFO L87 Difference]: Start difference. First operand 1033 states and 1279 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 06:37:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:15,524 INFO L93 Difference]: Finished difference Result 1121 states and 1321 transitions. [2021-05-06 06:37:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-06 06:37:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 117 [2021-05-06 06:37:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:15,527 INFO L225 Difference]: With dead ends: 1121 [2021-05-06 06:37:15,527 INFO L226 Difference]: Without dead ends: 1121 [2021-05-06 06:37:15,528 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1038.7ms TimeCoverageRelationStatistics Valid=1473, Invalid=4533, Unknown=0, NotChecked=0, Total=6006 [2021-05-06 06:37:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-05-06 06:37:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1022. [2021-05-06 06:37:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 979 states have (on average 1.1736465781409602) internal successors, (1149), 986 states have internal predecessors, (1149), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 06:37:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1194 transitions. [2021-05-06 06:37:15,541 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1194 transitions. Word has length 117 [2021-05-06 06:37:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:15,541 INFO L480 AbstractCegarLoop]: Abstraction has 1022 states and 1194 transitions. [2021-05-06 06:37:15,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 06:37:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1194 transitions. [2021-05-06 06:37:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-06 06:37:15,543 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:15,543 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 29, 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] [2021-05-06 06:37:15,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-05-06 06:37:15,761 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1939260095, now seen corresponding path program 4 times [2021-05-06 06:37:15,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:15,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4711911] [2021-05-06 06:37:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:15,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:15,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:15,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 06:37:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 710 proven. 330 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-05-06 06:37:15,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:15,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4711911] [2021-05-06 06:37:15,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4711911] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:15,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836719843] [2021-05-06 06:37:15,995 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:16,102 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 06:37:16,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:16,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2021-05-06 06:37:16,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:16,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 398 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:16,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836719843] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:16,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:16,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 33] total 52 [2021-05-06 06:37:16,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599459644] [2021-05-06 06:37:16,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-06 06:37:16,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-06 06:37:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2205, Unknown=0, NotChecked=0, Total=2652 [2021-05-06 06:37:16,897 INFO L87 Difference]: Start difference. First operand 1022 states and 1194 transitions. Second operand has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:18,579 INFO L93 Difference]: Finished difference Result 1432 states and 1674 transitions. [2021-05-06 06:37:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-06 06:37:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 123 [2021-05-06 06:37:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:18,595 INFO L225 Difference]: With dead ends: 1432 [2021-05-06 06:37:18,595 INFO L226 Difference]: Without dead ends: 1432 [2021-05-06 06:37:18,596 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 1699.7ms TimeCoverageRelationStatistics Valid=2044, Invalid=7856, Unknown=0, NotChecked=0, Total=9900 [2021-05-06 06:37:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2021-05-06 06:37:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 981. [2021-05-06 06:37:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 938 states have (on average 1.1865671641791045) internal successors, (1113), 945 states have internal predecessors, (1113), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 06:37:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1158 transitions. [2021-05-06 06:37:18,612 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1158 transitions. Word has length 123 [2021-05-06 06:37:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:18,612 INFO L480 AbstractCegarLoop]: Abstraction has 981 states and 1158 transitions. [2021-05-06 06:37:18,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1158 transitions. [2021-05-06 06:37:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-06 06:37:18,613 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:18,614 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 30, 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] [2021-05-06 06:37:18,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-05-06 06:37:18,832 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 934797984, now seen corresponding path program 1 times [2021-05-06 06:37:18,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:18,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103873224] [2021-05-06 06:37:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:18,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:18,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:18,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 06:37:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 3 proven. 711 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2021-05-06 06:37:18,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:18,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103873224] [2021-05-06 06:37:18,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103873224] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:18,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760397273] [2021-05-06 06:37:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:18,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 06:37:18,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:18,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:18,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-05-06 06:37:19,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760397273] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:19,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:19,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 23 [2021-05-06 06:37:19,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155462559] [2021-05-06 06:37:19,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-06 06:37:19,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-06 06:37:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2021-05-06 06:37:19,289 INFO L87 Difference]: Start difference. First operand 981 states and 1158 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 06:37:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:20,240 INFO L93 Difference]: Finished difference Result 1230 states and 1431 transitions. [2021-05-06 06:37:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-06 06:37:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 123 [2021-05-06 06:37:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:20,243 INFO L225 Difference]: With dead ends: 1230 [2021-05-06 06:37:20,243 INFO L226 Difference]: Without dead ends: 1230 [2021-05-06 06:37:20,244 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 929.6ms TimeCoverageRelationStatistics Valid=1695, Invalid=3707, Unknown=0, NotChecked=0, Total=5402 [2021-05-06 06:37:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-05-06 06:37:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1069. [2021-05-06 06:37:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1025 states have (on average 1.1726829268292682) internal successors, (1202), 1032 states have internal predecessors, (1202), 24 states have call successors, (24), 20 states have call predecessors, (24), 19 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-06 06:37:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1249 transitions. [2021-05-06 06:37:20,255 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1249 transitions. Word has length 123 [2021-05-06 06:37:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 1249 transitions. [2021-05-06 06:37:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 06:37:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1249 transitions. [2021-05-06 06:37:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-06 06:37:20,256 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:20,256 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 30, 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] [2021-05-06 06:37:20,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:20,473 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1219098231, now seen corresponding path program 1 times [2021-05-06 06:37:20,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:20,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153353747] [2021-05-06 06:37:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:20,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:20,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:20,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-06 06:37:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 805 proven. 376 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-05-06 06:37:20,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:20,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153353747] [2021-05-06 06:37:20,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153353747] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:20,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097088988] [2021-05-06 06:37:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:20,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-06 06:37:20,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:20,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:20,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,074 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-05-06 06:37:21,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097088988] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:21,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:21,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2021-05-06 06:37:21,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996194476] [2021-05-06 06:37:21,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-06 06:37:21,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:21,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-06 06:37:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=981, Unknown=0, NotChecked=0, Total=1482 [2021-05-06 06:37:21,194 INFO L87 Difference]: Start difference. First operand 1069 states and 1249 transitions. Second operand has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:21,893 INFO L93 Difference]: Finished difference Result 1328 states and 1569 transitions. [2021-05-06 06:37:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-06 06:37:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 129 [2021-05-06 06:37:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:21,896 INFO L225 Difference]: With dead ends: 1328 [2021-05-06 06:37:21,896 INFO L226 Difference]: Without dead ends: 1324 [2021-05-06 06:37:21,897 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 753.6ms TimeCoverageRelationStatistics Valid=1159, Invalid=3001, Unknown=0, NotChecked=0, Total=4160 [2021-05-06 06:37:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-05-06 06:37:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1261. [2021-05-06 06:37:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1211 states have (on average 1.1816680429397193) internal successors, (1431), 1219 states have internal predecessors, (1431), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 06:37:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1484 transitions. [2021-05-06 06:37:21,910 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1484 transitions. Word has length 129 [2021-05-06 06:37:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:21,910 INFO L480 AbstractCegarLoop]: Abstraction has 1261 states and 1484 transitions. [2021-05-06 06:37:21,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1484 transitions. [2021-05-06 06:37:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-06 06:37:21,911 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:21,911 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 32, 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] [2021-05-06 06:37:22,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:22,125 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -376627745, now seen corresponding path program 2 times [2021-05-06 06:37:22,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:22,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999758802] [2021-05-06 06:37:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:22,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:22,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:22,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 06:37:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 906 proven. 425 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-05-06 06:37:22,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:22,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999758802] [2021-05-06 06:37:22,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999758802] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:22,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772791837] [2021-05-06 06:37:22,386 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:22,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:22,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:22,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-06 06:37:22,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:22,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 7 proven. 1293 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-05-06 06:37:22,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772791837] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:22,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:22,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-06 06:37:22,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341210576] [2021-05-06 06:37:22,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-06 06:37:22,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-06 06:37:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1179, Unknown=0, NotChecked=0, Total=1722 [2021-05-06 06:37:22,899 INFO L87 Difference]: Start difference. First operand 1261 states and 1484 transitions. Second operand has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 06:37:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:23,486 INFO L93 Difference]: Finished difference Result 1590 states and 1895 transitions. [2021-05-06 06:37:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-06 06:37:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2021-05-06 06:37:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:23,496 INFO L225 Difference]: With dead ends: 1590 [2021-05-06 06:37:23,496 INFO L226 Difference]: Without dead ends: 1584 [2021-05-06 06:37:23,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 676.7ms TimeCoverageRelationStatistics Valid=1088, Invalid=2694, Unknown=0, NotChecked=0, Total=3782 [2021-05-06 06:37:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-05-06 06:37:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1274. [2021-05-06 06:37:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1224 states have (on average 1.1854575163398693) internal successors, (1451), 1232 states have internal predecessors, (1451), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 06:37:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1504 transitions. [2021-05-06 06:37:23,510 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1504 transitions. Word has length 135 [2021-05-06 06:37:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:23,510 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 1504 transitions. [2021-05-06 06:37:23,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 06:37:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1504 transitions. [2021-05-06 06:37:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-05-06 06:37:23,512 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:23,512 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 34, 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] [2021-05-06 06:37:23,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-05-06 06:37:23,728 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash 782489779, now seen corresponding path program 1 times [2021-05-06 06:37:23,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:23,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417663516] [2021-05-06 06:37:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:23,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:23,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:23,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 06:37:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 957 proven. 425 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-05-06 06:37:23,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:23,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417663516] [2021-05-06 06:37:23,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417663516] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:23,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171314476] [2021-05-06 06:37:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:23,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2021-05-06 06:37:23,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:24,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 955 proven. 425 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2021-05-06 06:37:24,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171314476] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:24,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:24,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2021-05-06 06:37:24,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527652958] [2021-05-06 06:37:24,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-06 06:37:24,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-06 06:37:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=970, Unknown=0, NotChecked=0, Total=1560 [2021-05-06 06:37:24,397 INFO L87 Difference]: Start difference. First operand 1274 states and 1504 transitions. Second operand has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:24,704 INFO L93 Difference]: Finished difference Result 1377 states and 1624 transitions. [2021-05-06 06:37:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-06 06:37:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 138 [2021-05-06 06:37:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:24,707 INFO L225 Difference]: With dead ends: 1377 [2021-05-06 06:37:24,707 INFO L226 Difference]: Without dead ends: 1377 [2021-05-06 06:37:24,708 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 401.0ms TimeCoverageRelationStatistics Valid=594, Invalid=1046, Unknown=0, NotChecked=0, Total=1640 [2021-05-06 06:37:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2021-05-06 06:37:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1324. [2021-05-06 06:37:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1274 states have (on average 1.1797488226059654) internal successors, (1503), 1282 states have internal predecessors, (1503), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (26), 18 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-06 06:37:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1556 transitions. [2021-05-06 06:37:24,726 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1556 transitions. Word has length 138 [2021-05-06 06:37:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1556 transitions. [2021-05-06 06:37:24,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1556 transitions. [2021-05-06 06:37:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-06 06:37:24,728 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:24,728 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 34, 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] [2021-05-06 06:37:24,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:24,947 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1476745417, now seen corresponding path program 3 times [2021-05-06 06:37:24,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:24,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342035173] [2021-05-06 06:37:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:25,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:25,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:25,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-06 06:37:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 1013 proven. 477 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2021-05-06 06:37:25,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:25,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342035173] [2021-05-06 06:37:25,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342035173] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:25,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135890900] [2021-05-06 06:37:25,185 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:25,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-05-06 06:37:25,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:25,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-06 06:37:25,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:25,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 1 proven. 1016 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-05-06 06:37:25,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135890900] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:25,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:25,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2021-05-06 06:37:25,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033011494] [2021-05-06 06:37:25,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-06 06:37:25,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-06 06:37:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 06:37:25,581 INFO L87 Difference]: Start difference. First operand 1324 states and 1556 transitions. Second operand has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:28,571 INFO L93 Difference]: Finished difference Result 1739 states and 2059 transitions. [2021-05-06 06:37:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-05-06 06:37:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 141 [2021-05-06 06:37:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:28,575 INFO L225 Difference]: With dead ends: 1739 [2021-05-06 06:37:28,575 INFO L226 Difference]: Without dead ends: 1730 [2021-05-06 06:37:28,577 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6348 ImplicationChecksByTransitivity, 2626.1ms TimeCoverageRelationStatistics Valid=3364, Invalid=16376, Unknown=0, NotChecked=0, Total=19740 [2021-05-06 06:37:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2021-05-06 06:37:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1405. [2021-05-06 06:37:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1353 states have (on average 1.1759053954175906) internal successors, (1591), 1361 states have internal predecessors, (1591), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 06:37:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1646 transitions. [2021-05-06 06:37:28,596 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1646 transitions. Word has length 141 [2021-05-06 06:37:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:28,596 INFO L480 AbstractCegarLoop]: Abstraction has 1405 states and 1646 transitions. [2021-05-06 06:37:28,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 31 states have internal predecessors, (109), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-06 06:37:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1646 transitions. [2021-05-06 06:37:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-05-06 06:37:28,598 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:28,598 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 36, 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] [2021-05-06 06:37:28,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-05-06 06:37:28,813 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2074253891, now seen corresponding path program 2 times [2021-05-06 06:37:28,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:28,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382848657] [2021-05-06 06:37:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:29,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:29,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:29,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-06 06:37:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1067 proven. 477 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-05-06 06:37:29,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:29,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382848657] [2021-05-06 06:37:29,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382848657] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:29,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64953777] [2021-05-06 06:37:29,039 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:29,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:29,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:29,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-06 06:37:29,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:29,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,388 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1065 proven. 477 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-05-06 06:37:29,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64953777] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:29,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:29,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-06 06:37:29,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171712728] [2021-05-06 06:37:29,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-06 06:37:29,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-06 06:37:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2021-05-06 06:37:29,522 INFO L87 Difference]: Start difference. First operand 1405 states and 1646 transitions. Second operand has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:29,743 INFO L93 Difference]: Finished difference Result 1513 states and 1772 transitions. [2021-05-06 06:37:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-06 06:37:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 144 [2021-05-06 06:37:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:29,748 INFO L225 Difference]: With dead ends: 1513 [2021-05-06 06:37:29,748 INFO L226 Difference]: Without dead ends: 1513 [2021-05-06 06:37:29,748 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 436.5ms TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2021-05-06 06:37:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-05-06 06:37:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1457. [2021-05-06 06:37:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1405 states have (on average 1.1708185053380782) internal successors, (1645), 1413 states have internal predecessors, (1645), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 06:37:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1700 transitions. [2021-05-06 06:37:29,762 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1700 transitions. Word has length 144 [2021-05-06 06:37:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:29,762 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 1700 transitions. [2021-05-06 06:37:29,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1700 transitions. [2021-05-06 06:37:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-06 06:37:29,764 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:29,764 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 37, 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] [2021-05-06 06:37:29,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-05-06 06:37:29,973 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1298474945, now seen corresponding path program 5 times [2021-05-06 06:37:29,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:29,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025846520] [2021-05-06 06:37:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:30,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:30,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:30,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-06 06:37:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1126 proven. 532 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2021-05-06 06:37:30,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:30,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025846520] [2021-05-06 06:37:30,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025846520] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:30,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542889313] [2021-05-06 06:37:30,192 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:30,267 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2021-05-06 06:37:30,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:30,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-06 06:37:30,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:30,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1123 proven. 532 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-05-06 06:37:30,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542889313] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:30,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:30,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2021-05-06 06:37:30,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972047339] [2021-05-06 06:37:30,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-06 06:37:30,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-06 06:37:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1302, Unknown=0, NotChecked=0, Total=1980 [2021-05-06 06:37:30,697 INFO L87 Difference]: Start difference. First operand 1457 states and 1700 transitions. Second operand has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:31,440 INFO L93 Difference]: Finished difference Result 1775 states and 2090 transitions. [2021-05-06 06:37:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-06 06:37:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 147 [2021-05-06 06:37:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:31,453 INFO L225 Difference]: With dead ends: 1775 [2021-05-06 06:37:31,453 INFO L226 Difference]: Without dead ends: 1769 [2021-05-06 06:37:31,454 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 877.3ms TimeCoverageRelationStatistics Valid=1531, Invalid=3871, Unknown=0, NotChecked=0, Total=5402 [2021-05-06 06:37:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2021-05-06 06:37:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1523. [2021-05-06 06:37:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1471 states have (on average 1.1692726036709722) internal successors, (1720), 1479 states have internal predecessors, (1720), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 19 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-06 06:37:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1775 transitions. [2021-05-06 06:37:31,468 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1775 transitions. Word has length 147 [2021-05-06 06:37:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:31,468 INFO L480 AbstractCegarLoop]: Abstraction has 1523 states and 1775 transitions. [2021-05-06 06:37:31,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 44 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-06 06:37:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1775 transitions. [2021-05-06 06:37:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-06 06:37:31,470 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:31,470 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 39, 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] [2021-05-06 06:37:31,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-05-06 06:37:31,686 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1764251543, now seen corresponding path program 6 times [2021-05-06 06:37:31,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:31,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148220359] [2021-05-06 06:37:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 644 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:32,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:32,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148220359] [2021-05-06 06:37:32,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148220359] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:32,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413348747] [2021-05-06 06:37:32,223 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:32,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-05-06 06:37:32,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:32,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-06 06:37:32,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:32,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:32,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:32,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:32,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2021-05-06 06:37:32,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413348747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 06:37:32,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 06:37:32,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [44] total 48 [2021-05-06 06:37:32,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162908306] [2021-05-06 06:37:32,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 06:37:32,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 06:37:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1777, Unknown=0, NotChecked=0, Total=2256 [2021-05-06 06:37:32,493 INFO L87 Difference]: Start difference. First operand 1523 states and 1775 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-05-06 06:37:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:32,557 INFO L93 Difference]: Finished difference Result 1252 states and 1439 transitions. [2021-05-06 06:37:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 06:37:32,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2021-05-06 06:37:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:32,560 INFO L225 Difference]: With dead ends: 1252 [2021-05-06 06:37:32,560 INFO L226 Difference]: Without dead ends: 1237 [2021-05-06 06:37:32,560 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 582.4ms TimeCoverageRelationStatistics Valid=491, Invalid=1959, Unknown=0, NotChecked=0, Total=2450 [2021-05-06 06:37:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2021-05-06 06:37:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 998. [2021-05-06 06:37:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 962 states have (on average 1.1496881496881497) internal successors, (1106), 967 states have internal predecessors, (1106), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-06 06:37:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1141 transitions. [2021-05-06 06:37:32,569 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1141 transitions. Word has length 153 [2021-05-06 06:37:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:32,569 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1141 transitions. [2021-05-06 06:37:32,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-05-06 06:37:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1141 transitions. [2021-05-06 06:37:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-06 06:37:32,570 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:32,570 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 38, 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] [2021-05-06 06:37:32,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-05-06 06:37:32,784 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1938512440, now seen corresponding path program 7 times [2021-05-06 06:37:32,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:32,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507973852] [2021-05-06 06:37:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1338 proven. 2 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2021-05-06 06:37:32,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:32,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507973852] [2021-05-06 06:37:32,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507973852] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:32,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419454725] [2021-05-06 06:37:32,873 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:32,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 89 conjunts are in the unsatisfiable core [2021-05-06 06:37:32,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 66 proven. 2363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 06:37:34,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419454725] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:34,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:34,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 46] total 51 [2021-05-06 06:37:34,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113326865] [2021-05-06 06:37:34,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-06 06:37:34,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-06 06:37:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2407, Unknown=0, NotChecked=0, Total=2550 [2021-05-06 06:37:34,105 INFO L87 Difference]: Start difference. First operand 998 states and 1141 transitions. Second operand has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-06 06:37:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:40,573 INFO L93 Difference]: Finished difference Result 1520 states and 1689 transitions. [2021-05-06 06:37:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-05-06 06:37:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 153 [2021-05-06 06:37:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:40,577 INFO L225 Difference]: With dead ends: 1520 [2021-05-06 06:37:40,577 INFO L226 Difference]: Without dead ends: 1516 [2021-05-06 06:37:40,578 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10367 ImplicationChecksByTransitivity, 3041.5ms TimeCoverageRelationStatistics Valid=1110, Invalid=29340, Unknown=0, NotChecked=0, Total=30450 [2021-05-06 06:37:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-05-06 06:37:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1174. [2021-05-06 06:37:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1132 states have (on average 1.1298586572438163) internal successors, (1279), 1138 states have internal predecessors, (1279), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-06 06:37:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1320 transitions. [2021-05-06 06:37:40,590 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1320 transitions. Word has length 153 [2021-05-06 06:37:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:40,590 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1320 transitions. [2021-05-06 06:37:40,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-06 06:37:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1320 transitions. [2021-05-06 06:37:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-06 06:37:40,592 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:40,592 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 57, 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] [2021-05-06 06:37:40,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-05-06 06:37:40,805 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1785002665, now seen corresponding path program 4 times [2021-05-06 06:37:40,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:40,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306815585] [2021-05-06 06:37:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:41,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:41,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:41,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:41,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 65 proven. 4265 refuted. 0 times theorem prover too weak. 1189 trivial. 0 not checked. [2021-05-06 06:37:41,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:41,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306815585] [2021-05-06 06:37:41,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306815585] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:41,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091187715] [2021-05-06 06:37:41,273 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:41,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 06:37:41,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:41,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 62 conjunts are in the unsatisfiable core [2021-05-06 06:37:41,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:41,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,942 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:41,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,800 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:42,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 532 proven. 4393 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2021-05-06 06:37:43,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091187715] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:43,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:43,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 52] total 78 [2021-05-06 06:37:43,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497145333] [2021-05-06 06:37:43,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-06 06:37:43,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-06 06:37:43,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2021-05-06 06:37:43,070 INFO L87 Difference]: Start difference. First operand 1174 states and 1320 transitions. Second operand has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-06 06:37:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:46,228 INFO L93 Difference]: Finished difference Result 1597 states and 1803 transitions. [2021-05-06 06:37:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-05-06 06:37:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 224 [2021-05-06 06:37:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:46,229 INFO L225 Difference]: With dead ends: 1597 [2021-05-06 06:37:46,230 INFO L226 Difference]: Without dead ends: 373 [2021-05-06 06:37:46,231 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8244 ImplicationChecksByTransitivity, 3547.4ms TimeCoverageRelationStatistics Valid=3675, Invalid=19277, Unknown=0, NotChecked=0, Total=22952 [2021-05-06 06:37:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-05-06 06:37:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 293. [2021-05-06 06:37:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 281 states have (on average 1.0249110320284698) internal successors, (288), 281 states have internal predecessors, (288), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-06 06:37:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 299 transitions. [2021-05-06 06:37:46,233 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 299 transitions. Word has length 224 [2021-05-06 06:37:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:46,233 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 299 transitions. [2021-05-06 06:37:46,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-06 06:37:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 299 transitions. [2021-05-06 06:37:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-06 06:37:46,234 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:46,235 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:46,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:46,436 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1121780440, now seen corresponding path program 2 times [2021-05-06 06:37:46,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:46,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77609963] [2021-05-06 06:37:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:46,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:46,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:46,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:46,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-06 06:37:46,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:46,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77609963] [2021-05-06 06:37:46,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77609963] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:46,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679609258] [2021-05-06 06:37:46,534 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:46,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:46,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:46,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-06 06:37:46,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:46,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-06 06:37:46,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679609258] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:46,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:46,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-05-06 06:37:46,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309522737] [2021-05-06 06:37:46,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 06:37:46,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 06:37:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-05-06 06:37:46,890 INFO L87 Difference]: Start difference. First operand 293 states and 299 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-06 06:37:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:46,997 INFO L93 Difference]: Finished difference Result 426 states and 436 transitions. [2021-05-06 06:37:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 06:37:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 224 [2021-05-06 06:37:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:46,999 INFO L225 Difference]: With dead ends: 426 [2021-05-06 06:37:46,999 INFO L226 Difference]: Without dead ends: 426 [2021-05-06 06:37:46,999 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 72.0ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-05-06 06:37:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-05-06 06:37:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 360. [2021-05-06 06:37:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 347 states have (on average 1.0230547550432276) internal successors, (355), 347 states have internal predecessors, (355), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 06:37:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 368 transitions. [2021-05-06 06:37:47,005 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 368 transitions. Word has length 224 [2021-05-06 06:37:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:47,005 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 368 transitions. [2021-05-06 06:37:47,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-06 06:37:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 368 transitions. [2021-05-06 06:37:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-05-06 06:37:47,006 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:47,006 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:47,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:47,207 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1926786838, now seen corresponding path program 3 times [2021-05-06 06:37:47,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:47,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411654705] [2021-05-06 06:37:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-06 06:37:47,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:47,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411654705] [2021-05-06 06:37:47,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411654705] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:47,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105893828] [2021-05-06 06:37:47,306 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:47,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-05-06 06:37:47,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:47,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 06:37:47,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:47,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-06 06:37:47,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105893828] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:47,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:47,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-06 06:37:47,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431817003] [2021-05-06 06:37:47,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 06:37:47,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 06:37:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-06 06:37:47,873 INFO L87 Difference]: Start difference. First operand 360 states and 368 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-06 06:37:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:48,004 INFO L93 Difference]: Finished difference Result 493 states and 505 transitions. [2021-05-06 06:37:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 06:37:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 295 [2021-05-06 06:37:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:48,006 INFO L225 Difference]: With dead ends: 493 [2021-05-06 06:37:48,006 INFO L226 Difference]: Without dead ends: 493 [2021-05-06 06:37:48,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 96.1ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-06 06:37:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-05-06 06:37:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 427. [2021-05-06 06:37:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 413 states have (on average 1.0217917675544794) internal successors, (422), 413 states have internal predecessors, (422), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 06:37:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 437 transitions. [2021-05-06 06:37:48,010 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 437 transitions. Word has length 295 [2021-05-06 06:37:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:48,010 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 437 transitions. [2021-05-06 06:37:48,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-06 06:37:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 437 transitions. [2021-05-06 06:37:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-05-06 06:37:48,011 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:48,012 INFO L523 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:48,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-05-06 06:37:48,222 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -857517800, now seen corresponding path program 4 times [2021-05-06 06:37:48,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:48,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110485811] [2021-05-06 06:37:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 12 proven. 12466 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-06 06:37:48,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:48,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110485811] [2021-05-06 06:37:48,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110485811] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:48,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106879738] [2021-05-06 06:37:48,342 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:48,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 06:37:48,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:48,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-06 06:37:48,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:48,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:48,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 544 proven. 12524 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2021-05-06 06:37:49,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106879738] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:49,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:49,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30] total 37 [2021-05-06 06:37:49,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212096820] [2021-05-06 06:37:49,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-06 06:37:49,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-06 06:37:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2021-05-06 06:37:49,384 INFO L87 Difference]: Start difference. First operand 427 states and 437 transitions. Second operand has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-06 06:37:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:49,911 INFO L93 Difference]: Finished difference Result 560 states and 574 transitions. [2021-05-06 06:37:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-06 06:37:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 366 [2021-05-06 06:37:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:49,913 INFO L225 Difference]: With dead ends: 560 [2021-05-06 06:37:49,913 INFO L226 Difference]: Without dead ends: 560 [2021-05-06 06:37:49,913 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 343 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 761.2ms TimeCoverageRelationStatistics Valid=1070, Invalid=2236, Unknown=0, NotChecked=0, Total=3306 [2021-05-06 06:37:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-05-06 06:37:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 494. [2021-05-06 06:37:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 479 states have (on average 1.0208768267223383) internal successors, (489), 479 states have internal predecessors, (489), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-06 06:37:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 506 transitions. [2021-05-06 06:37:49,917 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 506 transitions. Word has length 366 [2021-05-06 06:37:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:49,917 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 506 transitions. [2021-05-06 06:37:49,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-06 06:37:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 506 transitions. [2021-05-06 06:37:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-05-06 06:37:49,919 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:49,919 INFO L523 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:50,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:50,137 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:50,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 5 times [2021-05-06 06:37:50,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:50,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630590212] [2021-05-06 06:37:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2021-05-06 06:37:50,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:50,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630590212] [2021-05-06 06:37:50,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630590212] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:50,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659479907] [2021-05-06 06:37:50,268 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:50,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2021-05-06 06:37:50,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:50,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 31 conjunts are in the unsatisfiable core [2021-05-06 06:37:50,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:50,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,769 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:50,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 601 proven. 18720 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-06 06:37:51,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659479907] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:51,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:51,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 32] total 40 [2021-05-06 06:37:51,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092092124] [2021-05-06 06:37:51,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-06 06:37:51,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-06 06:37:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2021-05-06 06:37:51,576 INFO L87 Difference]: Start difference. First operand 494 states and 506 transitions. Second operand has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 06:37:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:52,463 INFO L93 Difference]: Finished difference Result 627 states and 643 transitions. [2021-05-06 06:37:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-06 06:37:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 437 [2021-05-06 06:37:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:52,464 INFO L225 Difference]: With dead ends: 627 [2021-05-06 06:37:52,465 INFO L226 Difference]: Without dead ends: 627 [2021-05-06 06:37:52,465 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 414 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 1085.8ms TimeCoverageRelationStatistics Valid=2188, Invalid=4454, Unknown=0, NotChecked=0, Total=6642 [2021-05-06 06:37:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-05-06 06:37:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 561. [2021-05-06 06:37:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 545 states have (on average 1.0201834862385322) internal successors, (556), 545 states have internal predecessors, (556), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-06 06:37:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 575 transitions. [2021-05-06 06:37:52,474 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 575 transitions. Word has length 437 [2021-05-06 06:37:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:52,474 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 575 transitions. [2021-05-06 06:37:52,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 4.625) internal successors, (185), 39 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 06:37:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 575 transitions. [2021-05-06 06:37:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2021-05-06 06:37:52,476 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:52,476 INFO L523 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:52,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-05-06 06:37:52,685 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1317032104, now seen corresponding path program 6 times [2021-05-06 06:37:52,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:52,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681699544] [2021-05-06 06:37:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:37:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-06 06:37:52,823 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:52,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681699544] [2021-05-06 06:37:52,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681699544] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:52,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136295565] [2021-05-06 06:37:52,824 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:53,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-06 06:37:53,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:53,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-06 06:37:53,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:53,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,508 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-06 06:37:53,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136295565] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:53,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:53,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-06 06:37:53,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949783125] [2021-05-06 06:37:53,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-06 06:37:53,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-06 06:37:53,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-06 06:37:53,743 INFO L87 Difference]: Start difference. First operand 561 states and 575 transitions. Second operand has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-06 06:37:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:53,928 INFO L93 Difference]: Finished difference Result 694 states and 712 transitions. [2021-05-06 06:37:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 06:37:53,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 508 [2021-05-06 06:37:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:53,933 INFO L225 Difference]: With dead ends: 694 [2021-05-06 06:37:53,933 INFO L226 Difference]: Without dead ends: 694 [2021-05-06 06:37:53,934 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 139.2ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-06 06:37:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-05-06 06:37:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 628. [2021-05-06 06:37:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 611 states have (on average 1.0196399345335516) internal successors, (623), 611 states have internal predecessors, (623), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-06 06:37:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 644 transitions. [2021-05-06 06:37:53,938 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 644 transitions. Word has length 508 [2021-05-06 06:37:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 644 transitions. [2021-05-06 06:37:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-06 06:37:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 644 transitions. [2021-05-06 06:37:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2021-05-06 06:37:53,941 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:53,941 INFO L523 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:54,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:54,145 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash 282505878, now seen corresponding path program 7 times [2021-05-06 06:37:54,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:54,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833872278] [2021-05-06 06:37:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:37:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:37:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-06 06:37:54,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:54,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833872278] [2021-05-06 06:37:54,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833872278] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:54,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796353751] [2021-05-06 06:37:54,297 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:54,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-06 06:37:54,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:54,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:54,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-06 06:37:55,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796353751] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:55,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:55,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-05-06 06:37:55,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329628169] [2021-05-06 06:37:55,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-06 06:37:55,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-06 06:37:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2021-05-06 06:37:55,238 INFO L87 Difference]: Start difference. First operand 628 states and 644 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-06 06:37:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:55,426 INFO L93 Difference]: Finished difference Result 761 states and 781 transitions. [2021-05-06 06:37:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-06 06:37:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 579 [2021-05-06 06:37:55,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:55,428 INFO L225 Difference]: With dead ends: 761 [2021-05-06 06:37:55,428 INFO L226 Difference]: Without dead ends: 761 [2021-05-06 06:37:55,429 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 173.5ms TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2021-05-06 06:37:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-05-06 06:37:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 695. [2021-05-06 06:37:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 677 states have (on average 1.0192023633677991) internal successors, (690), 677 states have internal predecessors, (690), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-06 06:37:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 713 transitions. [2021-05-06 06:37:55,433 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 713 transitions. Word has length 579 [2021-05-06 06:37:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:55,433 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 713 transitions. [2021-05-06 06:37:55,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-06 06:37:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 713 transitions. [2021-05-06 06:37:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2021-05-06 06:37:55,437 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:55,437 INFO L523 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:55,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-05-06 06:37:55,655 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1210704488, now seen corresponding path program 8 times [2021-05-06 06:37:55,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:55,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156917478] [2021-05-06 06:37:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:37:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:37:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:37:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-06 06:37:55,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:55,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156917478] [2021-05-06 06:37:55,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156917478] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:55,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572530713] [2021-05-06 06:37:55,859 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:56,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:37:56,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:56,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-06 06:37:56,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:56,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-06 06:37:56,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572530713] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:56,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:56,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-06 06:37:56,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791395134] [2021-05-06 06:37:56,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-06 06:37:56,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-06 06:37:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-06 06:37:56,824 INFO L87 Difference]: Start difference. First operand 695 states and 713 transitions. Second operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-06 06:37:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:56,995 INFO L93 Difference]: Finished difference Result 828 states and 850 transitions. [2021-05-06 06:37:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 06:37:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 650 [2021-05-06 06:37:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:56,998 INFO L225 Difference]: With dead ends: 828 [2021-05-06 06:37:56,998 INFO L226 Difference]: Without dead ends: 828 [2021-05-06 06:37:56,998 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 172.5ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-06 06:37:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-05-06 06:37:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 762. [2021-05-06 06:37:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 743 states have (on average 1.018842530282638) internal successors, (757), 743 states have internal predecessors, (757), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 06:37:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 782 transitions. [2021-05-06 06:37:57,003 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 782 transitions. Word has length 650 [2021-05-06 06:37:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:57,003 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 782 transitions. [2021-05-06 06:37:57,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-06 06:37:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 782 transitions. [2021-05-06 06:37:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2021-05-06 06:37:57,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:57,007 INFO L523 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:57,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-05-06 06:37:57,221 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1171932074, now seen corresponding path program 9 times [2021-05-06 06:37:57,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:57,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840171780] [2021-05-06 06:37:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:37:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:37:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:37:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:37:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-06 06:37:57,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:57,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840171780] [2021-05-06 06:37:57,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840171780] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:57,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75090818] [2021-05-06 06:37:57,422 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:57,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-05-06 06:37:57,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:57,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-06 06:37:57,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:57,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,749 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:57,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,291 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,292 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-06 06:37:58,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75090818] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:58,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:37:58,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-06 06:37:58,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595701636] [2021-05-06 06:37:58,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 06:37:58,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:37:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 06:37:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-06 06:37:58,622 INFO L87 Difference]: Start difference. First operand 762 states and 782 transitions. Second operand has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-06 06:37:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:37:58,804 INFO L93 Difference]: Finished difference Result 895 states and 919 transitions. [2021-05-06 06:37:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 06:37:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 721 [2021-05-06 06:37:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:37:58,806 INFO L225 Difference]: With dead ends: 895 [2021-05-06 06:37:58,806 INFO L226 Difference]: Without dead ends: 895 [2021-05-06 06:37:58,807 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 218.7ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-06 06:37:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2021-05-06 06:37:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 829. [2021-05-06 06:37:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 809 states have (on average 1.0185414091470952) internal successors, (824), 809 states have internal predecessors, (824), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-06 06:37:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 851 transitions. [2021-05-06 06:37:58,816 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 851 transitions. Word has length 721 [2021-05-06 06:37:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:37:58,817 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 851 transitions. [2021-05-06 06:37:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-06 06:37:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 851 transitions. [2021-05-06 06:37:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2021-05-06 06:37:58,822 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:37:58,822 INFO L523 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:37:59,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-05-06 06:37:59,033 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:37:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:37:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash 403348440, now seen corresponding path program 10 times [2021-05-06 06:37:59,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:37:59,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716999324] [2021-05-06 06:37:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:37:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:37:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:37:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:37:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:37:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:37:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:37:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:37:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:37:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:37:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:37:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:37:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:37:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:37:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 30 proven. 68575 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-06 06:37:59,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:37:59,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716999324] [2021-05-06 06:37:59,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716999324] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:37:59,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862236162] [2021-05-06 06:37:59,279 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:37:59,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 06:37:59,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:37:59,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 34 conjunts are in the unsatisfiable core [2021-05-06 06:37:59,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:37:59,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,845 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:37:59,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:00,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 562 proven. 68633 refuted. 0 times theorem prover too weak. 6080 trivial. 0 not checked. [2021-05-06 06:38:01,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862236162] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:01,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:01,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 36] total 49 [2021-05-06 06:38:01,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926344220] [2021-05-06 06:38:01,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-06 06:38:01,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-06 06:38:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2021-05-06 06:38:01,219 INFO L87 Difference]: Start difference. First operand 829 states and 851 transitions. Second operand has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-06 06:38:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:01,887 INFO L93 Difference]: Finished difference Result 962 states and 988 transitions. [2021-05-06 06:38:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-06 06:38:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 792 [2021-05-06 06:38:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:01,889 INFO L225 Difference]: With dead ends: 962 [2021-05-06 06:38:01,889 INFO L226 Difference]: Without dead ends: 962 [2021-05-06 06:38:01,889 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 763 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1044.2ms TimeCoverageRelationStatistics Valid=1505, Invalid=3325, Unknown=0, NotChecked=0, Total=4830 [2021-05-06 06:38:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-05-06 06:38:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 896. [2021-05-06 06:38:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 875 states have (on average 1.0182857142857142) internal successors, (891), 875 states have internal predecessors, (891), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-06 06:38:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 920 transitions. [2021-05-06 06:38:01,895 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 920 transitions. Word has length 792 [2021-05-06 06:38:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:01,895 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 920 transitions. [2021-05-06 06:38:01,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-06 06:38:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 920 transitions. [2021-05-06 06:38:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2021-05-06 06:38:01,900 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:01,900 INFO L523 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:02,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:02,102 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1864676886, now seen corresponding path program 11 times [2021-05-06 06:38:02,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:02,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633023639] [2021-05-06 06:38:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 33 proven. 82291 refuted. 0 times theorem prover too weak. 7300 trivial. 0 not checked. [2021-05-06 06:38:02,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:02,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633023639] [2021-05-06 06:38:02,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633023639] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:02,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461278769] [2021-05-06 06:38:02,365 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:02,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2021-05-06 06:38:02,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:02,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 37 conjunts are in the unsatisfiable core [2021-05-06 06:38:02,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:03,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,388 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:03,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 643 proven. 82311 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-06 06:38:04,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461278769] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:04,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:04,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 38] total 52 [2021-05-06 06:38:04,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657815347] [2021-05-06 06:38:04,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-06 06:38:04,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-06 06:38:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2044, Unknown=0, NotChecked=0, Total=2652 [2021-05-06 06:38:04,862 INFO L87 Difference]: Start difference. First operand 896 states and 920 transitions. Second operand has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-06 06:38:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:05,907 INFO L93 Difference]: Finished difference Result 1029 states and 1057 transitions. [2021-05-06 06:38:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-06 06:38:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) Word has length 863 [2021-05-06 06:38:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:05,909 INFO L225 Difference]: With dead ends: 1029 [2021-05-06 06:38:05,909 INFO L226 Difference]: Without dead ends: 1029 [2021-05-06 06:38:05,910 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 834 SyntacticMatches, 20 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 1410.3ms TimeCoverageRelationStatistics Valid=2893, Invalid=5849, Unknown=0, NotChecked=0, Total=8742 [2021-05-06 06:38:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-05-06 06:38:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 963. [2021-05-06 06:38:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 941 states have (on average 1.0180658873538788) internal successors, (958), 941 states have internal predecessors, (958), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-06 06:38:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 989 transitions. [2021-05-06 06:38:05,916 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 989 transitions. Word has length 863 [2021-05-06 06:38:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:05,917 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 989 transitions. [2021-05-06 06:38:05,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-06 06:38:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 989 transitions. [2021-05-06 06:38:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2021-05-06 06:38:05,922 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:05,923 INFO L523 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:06,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:06,133 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1153357288, now seen corresponding path program 12 times [2021-05-06 06:38:06,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:06,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939004480] [2021-05-06 06:38:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-06 06:38:06,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:06,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939004480] [2021-05-06 06:38:06,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939004480] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:06,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443617334] [2021-05-06 06:38:06,427 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:06,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-06 06:38:06,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:06,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-06 06:38:06,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:06,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:06,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:06,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:06,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,845 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:07,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-06 06:38:08,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443617334] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:08,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:08,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-06 06:38:08,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457459002] [2021-05-06 06:38:08,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-06 06:38:08,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-06 06:38:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-06 06:38:08,151 INFO L87 Difference]: Start difference. First operand 963 states and 989 transitions. Second operand has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-06 06:38:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:08,472 INFO L93 Difference]: Finished difference Result 1096 states and 1126 transitions. [2021-05-06 06:38:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 06:38:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) Word has length 934 [2021-05-06 06:38:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:08,473 INFO L225 Difference]: With dead ends: 1096 [2021-05-06 06:38:08,474 INFO L226 Difference]: Without dead ends: 1096 [2021-05-06 06:38:08,474 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 290.9ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 06:38:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-05-06 06:38:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1030. [2021-05-06 06:38:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1007 states have (on average 1.0178748758689176) internal successors, (1025), 1007 states have internal predecessors, (1025), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-06 06:38:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1058 transitions. [2021-05-06 06:38:08,480 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1058 transitions. Word has length 934 [2021-05-06 06:38:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:08,480 INFO L480 AbstractCegarLoop]: Abstraction has 1030 states and 1058 transitions. [2021-05-06 06:38:08,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-06 06:38:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1058 transitions. [2021-05-06 06:38:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2021-05-06 06:38:08,486 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:08,487 INFO L523 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:08,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-05-06 06:38:08,705 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 13 times [2021-05-06 06:38:08,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:08,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033388844] [2021-05-06 06:38:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-06 06:38:09,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:09,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033388844] [2021-05-06 06:38:09,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033388844] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:09,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225891670] [2021-05-06 06:38:09,032 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:09,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-06 06:38:09,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:09,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,749 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,942 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,943 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:09,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-06 06:38:10,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225891670] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:10,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:10,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-05-06 06:38:10,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142250028] [2021-05-06 06:38:10,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-06 06:38:10,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-06 06:38:10,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2021-05-06 06:38:10,650 INFO L87 Difference]: Start difference. First operand 1030 states and 1058 transitions. Second operand has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-06 06:38:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:10,913 INFO L93 Difference]: Finished difference Result 1163 states and 1195 transitions. [2021-05-06 06:38:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-06 06:38:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) Word has length 1005 [2021-05-06 06:38:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:10,914 INFO L225 Difference]: With dead ends: 1163 [2021-05-06 06:38:10,915 INFO L226 Difference]: Without dead ends: 1163 [2021-05-06 06:38:10,915 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 318.6ms TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2021-05-06 06:38:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-05-06 06:38:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1097. [2021-05-06 06:38:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1073 states have (on average 1.0177073625349486) internal successors, (1092), 1073 states have internal predecessors, (1092), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-06 06:38:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1127 transitions. [2021-05-06 06:38:10,921 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1127 transitions. Word has length 1005 [2021-05-06 06:38:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1127 transitions. [2021-05-06 06:38:10,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-06 06:38:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1127 transitions. [2021-05-06 06:38:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2021-05-06 06:38:10,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:10,930 INFO L523 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:11,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:11,130 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2073938008, now seen corresponding path program 14 times [2021-05-06 06:38:11,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:11,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400613296] [2021-05-06 06:38:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 06:38:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-06 06:38:11,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:11,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400613296] [2021-05-06 06:38:11,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400613296] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:11,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551640996] [2021-05-06 06:38:11,478 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:11,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 06:38:11,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:11,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-06 06:38:11,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:11,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,829 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:11,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:12,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,074 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-06 06:38:13,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551640996] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:13,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:13,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2021-05-06 06:38:13,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575592575] [2021-05-06 06:38:13,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-06 06:38:13,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-06 06:38:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2021-05-06 06:38:13,194 INFO L87 Difference]: Start difference. First operand 1097 states and 1127 transitions. Second operand has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-06 06:38:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:13,466 INFO L93 Difference]: Finished difference Result 1230 states and 1264 transitions. [2021-05-06 06:38:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-06 06:38:13,466 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) Word has length 1076 [2021-05-06 06:38:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:13,468 INFO L225 Difference]: With dead ends: 1230 [2021-05-06 06:38:13,468 INFO L226 Difference]: Without dead ends: 1230 [2021-05-06 06:38:13,468 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 334.7ms TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2021-05-06 06:38:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-05-06 06:38:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1164. [2021-05-06 06:38:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1139 states have (on average 1.0175592625109746) internal successors, (1159), 1139 states have internal predecessors, (1159), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-06 06:38:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1196 transitions. [2021-05-06 06:38:13,475 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1196 transitions. Word has length 1076 [2021-05-06 06:38:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:13,475 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1196 transitions. [2021-05-06 06:38:13,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-06 06:38:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1196 transitions. [2021-05-06 06:38:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2021-05-06 06:38:13,483 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:13,483 INFO L523 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:13,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:13,685 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2069726826, now seen corresponding path program 15 times [2021-05-06 06:38:13,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:13,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811911071] [2021-05-06 06:38:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 06:38:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 06:38:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-06 06:38:14,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:14,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811911071] [2021-05-06 06:38:14,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811911071] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:14,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925337252] [2021-05-06 06:38:14,047 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:14,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2021-05-06 06:38:14,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:14,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 1811 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-06 06:38:14,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:15,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:15,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-06 06:38:16,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925337252] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:16,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:16,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2021-05-06 06:38:16,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112216018] [2021-05-06 06:38:16,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-06 06:38:16,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:16,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-06 06:38:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2021-05-06 06:38:16,567 INFO L87 Difference]: Start difference. First operand 1164 states and 1196 transitions. Second operand has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-06 06:38:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:16,897 INFO L93 Difference]: Finished difference Result 1297 states and 1333 transitions. [2021-05-06 06:38:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-06 06:38:16,897 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) Word has length 1147 [2021-05-06 06:38:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:16,899 INFO L225 Difference]: With dead ends: 1297 [2021-05-06 06:38:16,899 INFO L226 Difference]: Without dead ends: 1297 [2021-05-06 06:38:16,899 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 394.5ms TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2021-05-06 06:38:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2021-05-06 06:38:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1231. [2021-05-06 06:38:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1205 states have (on average 1.0174273858921161) internal successors, (1226), 1205 states have internal predecessors, (1226), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-05-06 06:38:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1265 transitions. [2021-05-06 06:38:16,906 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1265 transitions. Word has length 1147 [2021-05-06 06:38:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:16,907 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1265 transitions. [2021-05-06 06:38:16,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-06 06:38:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1265 transitions. [2021-05-06 06:38:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1219 [2021-05-06 06:38:16,915 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:16,916 INFO L523 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:17,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-05-06 06:38:17,116 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1682208408, now seen corresponding path program 16 times [2021-05-06 06:38:17,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:17,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230988465] [2021-05-06 06:38:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 06:38:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 06:38:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 06:38:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 48 proven. 169576 refuted. 0 times theorem prover too weak. 10510 trivial. 0 not checked. [2021-05-06 06:38:17,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:17,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230988465] [2021-05-06 06:38:17,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230988465] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:17,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546738959] [2021-05-06 06:38:17,583 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:17,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 06:38:17,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:17,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 40 conjunts are in the unsatisfiable core [2021-05-06 06:38:17,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:17,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,889 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,994 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:17,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,333 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:18,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:19,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 580 proven. 169634 refuted. 0 times theorem prover too weak. 9920 trivial. 0 not checked. [2021-05-06 06:38:20,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546738959] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:20,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:20,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42] total 61 [2021-05-06 06:38:20,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710857232] [2021-05-06 06:38:20,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-06 06:38:20,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-06 06:38:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2021-05-06 06:38:20,481 INFO L87 Difference]: Start difference. First operand 1231 states and 1265 transitions. Second operand has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-06 06:38:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:21,238 INFO L93 Difference]: Finished difference Result 1364 states and 1402 transitions. [2021-05-06 06:38:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-06 06:38:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) Word has length 1218 [2021-05-06 06:38:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:21,240 INFO L225 Difference]: With dead ends: 1364 [2021-05-06 06:38:21,240 INFO L226 Difference]: Without dead ends: 1364 [2021-05-06 06:38:21,241 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1183 SyntacticMatches, 32 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 1535.8ms TimeCoverageRelationStatistics Valid=2048, Invalid=4594, Unknown=0, NotChecked=0, Total=6642 [2021-05-06 06:38:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-05-06 06:38:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1298. [2021-05-06 06:38:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1271 states have (on average 1.017309205350118) internal successors, (1293), 1271 states have internal predecessors, (1293), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-06 06:38:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1334 transitions. [2021-05-06 06:38:21,249 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1334 transitions. Word has length 1218 [2021-05-06 06:38:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:21,249 INFO L480 AbstractCegarLoop]: Abstraction has 1298 states and 1334 transitions. [2021-05-06 06:38:21,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-06 06:38:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1334 transitions. [2021-05-06 06:38:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2021-05-06 06:38:21,259 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:21,259 INFO L523 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:21,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-05-06 06:38:21,460 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1054425942, now seen corresponding path program 17 times [2021-05-06 06:38:21,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:21,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744510259] [2021-05-06 06:38:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 06:38:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 06:38:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 06:38:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-06 06:38:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 51 proven. 190774 refuted. 0 times theorem prover too weak. 11164 trivial. 0 not checked. [2021-05-06 06:38:21,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:21,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744510259] [2021-05-06 06:38:21,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744510259] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:21,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723881106] [2021-05-06 06:38:21,915 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:22,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2021-05-06 06:38:22,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:22,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 43 conjunts are in the unsatisfiable core [2021-05-06 06:38:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:23,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:23,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:24,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 741 proven. 190794 refuted. 0 times theorem prover too weak. 10454 trivial. 0 not checked. [2021-05-06 06:38:25,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723881106] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:25,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:25,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 44] total 64 [2021-05-06 06:38:25,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75218886] [2021-05-06 06:38:25,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-06 06:38:25,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:25,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-06 06:38:25,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=3139, Unknown=0, NotChecked=0, Total=4032 [2021-05-06 06:38:25,638 INFO L87 Difference]: Start difference. First operand 1298 states and 1334 transitions. Second operand has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-06 06:38:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:27,124 INFO L93 Difference]: Finished difference Result 1431 states and 1471 transitions. [2021-05-06 06:38:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-06 06:38:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) Word has length 1289 [2021-05-06 06:38:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:27,126 INFO L225 Difference]: With dead ends: 1431 [2021-05-06 06:38:27,126 INFO L226 Difference]: Without dead ends: 1431 [2021-05-06 06:38:27,127 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1256 SyntacticMatches, 30 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 2193.7ms TimeCoverageRelationStatistics Valid=5372, Invalid=10630, Unknown=0, NotChecked=0, Total=16002 [2021-05-06 06:38:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2021-05-06 06:38:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1365. [2021-05-06 06:38:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1337 states have (on average 1.0172026925953628) internal successors, (1360), 1337 states have internal predecessors, (1360), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 06:38:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1403 transitions. [2021-05-06 06:38:27,142 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1403 transitions. Word has length 1289 [2021-05-06 06:38:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:27,142 INFO L480 AbstractCegarLoop]: Abstraction has 1365 states and 1403 transitions. [2021-05-06 06:38:27,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-06 06:38:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1403 transitions. [2021-05-06 06:38:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2021-05-06 06:38:27,153 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:27,153 INFO L523 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:27,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-05-06 06:38:27,354 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -245812008, now seen corresponding path program 18 times [2021-05-06 06:38:27,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:27,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64088096] [2021-05-06 06:38:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 06:38:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 06:38:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-06 06:38:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-06 06:38:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-06 06:38:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-06 06:38:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-06 06:38:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-06 06:38:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-06 06:38:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-06 06:38:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-06 06:38:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-06 06:38:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-06 06:38:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-06 06:38:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-06 06:38:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-06 06:38:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-06 06:38:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-06 06:38:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-06 06:38:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1285 [2021-05-06 06:38:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 06:38:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-06 06:38:27,831 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 06:38:27,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64088096] [2021-05-06 06:38:27,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64088096] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:27,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997053648] [2021-05-06 06:38:27,831 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:28,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2021-05-06 06:38:28,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 06:38:28,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-06 06:38:28,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 06:38:28,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:28,945 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,294 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,800 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,801 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:29,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 06:38:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-06 06:38:30,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997053648] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 06:38:30,441 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 06:38:30,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-05-06 06:38:30,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324065034] [2021-05-06 06:38:30,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-06 06:38:30,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 06:38:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-06 06:38:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2021-05-06 06:38:30,443 INFO L87 Difference]: Start difference. First operand 1365 states and 1403 transitions. Second operand has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-06 06:38:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 06:38:30,767 INFO L93 Difference]: Finished difference Result 1498 states and 1540 transitions. [2021-05-06 06:38:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-06 06:38:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) Word has length 1360 [2021-05-06 06:38:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 06:38:30,770 INFO L225 Difference]: With dead ends: 1498 [2021-05-06 06:38:30,770 INFO L226 Difference]: Without dead ends: 1498 [2021-05-06 06:38:30,770 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1423 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 461.4ms TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2021-05-06 06:38:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-05-06 06:38:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1432. [2021-05-06 06:38:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1403 states have (on average 1.0171062009978618) internal successors, (1427), 1403 states have internal predecessors, (1427), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-06 06:38:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1472 transitions. [2021-05-06 06:38:30,778 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1472 transitions. Word has length 1360 [2021-05-06 06:38:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 06:38:30,779 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 1472 transitions. [2021-05-06 06:38:30,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-06 06:38:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1472 transitions. [2021-05-06 06:38:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2021-05-06 06:38:30,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 06:38:30,791 INFO L523 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 06:38:30,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 06:38:30,991 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 06:38:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 06:38:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 19 times [2021-05-06 06:38:30,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 06:38:30,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545281566] [2021-05-06 06:38:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 06:38:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 06:38:31,155 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 06:38:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 06:38:31,343 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 06:38:31,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-06 06:38:31,731 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-06 06:38:31,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-06 06:38:31,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 06:38:31 BasicIcfg [2021-05-06 06:38:31,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 06:38:31,963 INFO L168 Benchmark]: Toolchain (without parser) took 95173.74 ms. Allocated memory was 186.6 MB in the beginning and 810.5 MB in the end (delta: 623.9 MB). Free memory was 151.8 MB in the beginning and 432.4 MB in the end (delta: -280.6 MB). Peak memory consumption was 491.0 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,963 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 186.6 MB. Free memory is still 168.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 06:38:31,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.83 ms. Allocated memory is still 186.6 MB. Free memory was 151.6 MB in the beginning and 169.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,964 INFO L168 Benchmark]: Boogie Preprocessor took 43.43 ms. Allocated memory is still 186.6 MB. Free memory was 169.8 MB in the beginning and 168.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,964 INFO L168 Benchmark]: RCFGBuilder took 265.25 ms. Allocated memory is still 186.6 MB. Free memory was 168.2 MB in the beginning and 152.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,964 INFO L168 Benchmark]: IcfgTransformer took 26.89 ms. Allocated memory is still 186.6 MB. Free memory was 152.0 MB in the beginning and 150.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,964 INFO L168 Benchmark]: TraceAbstraction took 94629.99 ms. Allocated memory was 186.6 MB in the beginning and 810.5 MB in the end (delta: 623.9 MB). Free memory was 150.4 MB in the beginning and 432.4 MB in the end (delta: -282.0 MB). Peak memory consumption was 489.8 MB. Max. memory is 8.0 GB. [2021-05-06 06:38:31,964 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.52 ms. Allocated memory is still 186.6 MB. Free memory is still 168.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 199.83 ms. Allocated memory is still 186.6 MB. Free memory was 151.6 MB in the beginning and 169.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.43 ms. Allocated memory is still 186.6 MB. Free memory was 169.8 MB in the beginning and 168.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 265.25 ms. Allocated memory is still 186.6 MB. Free memory was 168.2 MB in the beginning and 152.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * IcfgTransformer took 26.89 ms. Allocated memory is still 186.6 MB. Free memory was 152.0 MB in the beginning and 150.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 94629.99 ms. Allocated memory was 186.6 MB in the beginning and 810.5 MB in the end (delta: 623.9 MB). Free memory was 150.4 MB in the beginning and 432.4 MB in the end (delta: -282.0 MB). Peak memory consumption was 489.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [\old(last)=52, \old(SIZE)=51, last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L6] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L21] RET assume_abort_if_not(last > 0) VAL [\old(last)=0, last=22, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=20, d=0, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=40, b=40, c=20, d=20, last=22, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [\old(last)=0, a=0, b=1, c=20, d=20, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=0, \old(last)=0, last=22, SIZE=20] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 94369.3ms, OverallIterations: 54, TraceHistogramMax: 400, EmptinessCheckTime: 130.7ms, AutomataDifference: 32506.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1164 SDtfs, 8955 SDslu, 3704 SDs, 0 SdLazy, 37344 SolverSat, 2327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12869.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18385 GetRequests, 15992 SyntacticMatches, 120 SemanticMatches, 2273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57666 ImplicationChecksByTransitivity, 31967.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=33, InterpolantAutomatonStates: 1554, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 472.3ms AutomataMinimizationTime, 53 MinimizatonAttempts, 4381 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1076.0ms SsaConstructionTime, 6415.1ms SatisfiabilityAnalysisTime, 41652.3ms InterpolantComputationTime, 33963 NumberOfCodeBlocks, 32732 NumberOfCodeBlocksAsserted, 1010 NumberOfCheckSat, 32432 ConstructedInterpolants, 0 QuantifiedInterpolants, 179494 SizeOfPredicates, 119 NumberOfNonLiveVariables, 27223 ConjunctsInSsa, 892 ConjunctsInUnsatCore, 100 InterpolantComputations, 11 PerfectInterpolantSequences, 262907/3130368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...