/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-a47f07a [2021-04-16 07:59:03,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-16 07:59:03,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-16 07:59:03,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-16 07:59:03,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-16 07:59:03,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-16 07:59:03,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-16 07:59:03,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-16 07:59:03,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-16 07:59:03,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-16 07:59:03,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-16 07:59:03,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-16 07:59:03,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-16 07:59:03,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-16 07:59:03,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-16 07:59:03,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-16 07:59:03,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-16 07:59:03,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-16 07:59:03,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-16 07:59:03,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-16 07:59:03,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-16 07:59:03,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-16 07:59:03,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-16 07:59:03,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-16 07:59:03,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-16 07:59:03,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-16 07:59:03,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-16 07:59:03,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-16 07:59:03,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-16 07:59:03,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-16 07:59:03,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-16 07:59:03,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-16 07:59:03,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-16 07:59:03,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-16 07:59:03,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-16 07:59:03,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-16 07:59:03,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-16 07:59:04,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-16 07:59:04,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-16 07:59:04,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-16 07:59:04,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-16 07:59:04,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-04-16 07:59:04,020 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-16 07:59:04,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-16 07:59:04,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-16 07:59:04,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-16 07:59:04,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-16 07:59:04,025 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-16 07:59:04,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-16 07:59:04,026 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-16 07:59:04,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-16 07:59:04,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-16 07:59:04,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-16 07:59:04,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-16 07:59:04,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-16 07:59:04,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-16 07:59:04,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-16 07:59:04,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-04-16 07:59:04,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-16 07:59:04,028 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-04-16 07:59:04,028 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-16 07:59:04,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-16 07:59:04,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-16 07:59:04,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-16 07:59:04,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-16 07:59:04,395 INFO L275 PluginConnector]: CDTParser initialized [2021-04-16 07:59:04,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2021-04-16 07:59:04,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3376bceb7/9183ea7966704dac9cbff33d85f8cacb/FLAG8b187023f [2021-04-16 07:59:04,884 INFO L306 CDTParser]: Found 1 translation units. [2021-04-16 07:59:04,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2021-04-16 07:59:04,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3376bceb7/9183ea7966704dac9cbff33d85f8cacb/FLAG8b187023f [2021-04-16 07:59:04,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3376bceb7/9183ea7966704dac9cbff33d85f8cacb [2021-04-16 07:59:04,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-16 07:59:04,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-16 07:59:04,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-16 07:59:04,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-16 07:59:04,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-16 07:59:04,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 07:59:04" (1/1) ... [2021-04-16 07:59:04,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612ca201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:04, skipping insertion in model container [2021-04-16 07:59:04,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 07:59:04" (1/1) ... [2021-04-16 07:59:04,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-16 07:59:04,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-16 07:59:05,096 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2021-04-16 07:59:05,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-16 07:59:05,152 INFO L203 MainTranslator]: Completed pre-run [2021-04-16 07:59:05,175 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2021-04-16 07:59:05,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-16 07:59:05,223 INFO L208 MainTranslator]: Completed translation [2021-04-16 07:59:05,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05 WrapperNode [2021-04-16 07:59:05,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-16 07:59:05,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-16 07:59:05,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-16 07:59:05,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-16 07:59:05,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (1/1) ... [2021-04-16 07:59:05,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-16 07:59:05,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-16 07:59:05,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-16 07:59:05,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-16 07:59:05,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (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-04-16 07:59:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-04-16 07:59:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-16 07:59:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-04-16 07:59:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-04-16 07:59:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-04-16 07:59:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2021-04-16 07:59:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2021-04-16 07:59:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-04-16 07:59:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-04-16 07:59:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-04-16 07:59:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-04-16 07:59:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-04-16 07:59:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-04-16 07:59:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-04-16 07:59:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-16 07:59:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-04-16 07:59:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-04-16 07:59:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-04-16 07:59:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-16 07:59:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-04-16 07:59:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-16 07:59:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-16 07:59:05,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-16 07:59:05,710 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-04-16 07:59:05,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 07:59:05 BoogieIcfgContainer [2021-04-16 07:59:05,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-16 07:59:05,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-16 07:59:05,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-16 07:59:05,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-16 07:59:05,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 07:59:04" (1/3) ... [2021-04-16 07:59:05,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58288e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 07:59:05, skipping insertion in model container [2021-04-16 07:59:05,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 07:59:05" (2/3) ... [2021-04-16 07:59:05,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58288e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 07:59:05, skipping insertion in model container [2021-04-16 07:59:05,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 07:59:05" (3/3) ... [2021-04-16 07:59:05,717 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.c [2021-04-16 07:59:05,722 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-04-16 07:59:05,725 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-16 07:59:05,737 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-04-16 07:59:05,752 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-16 07:59:05,752 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-16 07:59:05,752 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-04-16 07:59:05,752 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-16 07:59:05,752 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-16 07:59:05,753 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-16 07:59:05,753 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-16 07:59:05,753 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-16 07:59:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-04-16 07:59:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-04-16 07:59:05,771 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:05,771 INFO L519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:05,772 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1531213237, now seen corresponding path program 1 times [2021-04-16 07:59:05,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:05,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535071152] [2021-04-16 07:59:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:05,839 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:05,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:05,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:05,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:05,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:05,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:05,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:06,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535071152] [2021-04-16 07:59:06,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:06,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-16 07:59:06,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979042509] [2021-04-16 07:59:06,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-16 07:59:06,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:06,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-16 07:59:06,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-16 07:59:06,098 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-04-16 07:59:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:06,457 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2021-04-16 07:59:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-16 07:59:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2021-04-16 07:59:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:06,467 INFO L225 Difference]: With dead ends: 113 [2021-04-16 07:59:06,467 INFO L226 Difference]: Without dead ends: 56 [2021-04-16 07:59:06,471 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-16 07:59:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-04-16 07:59:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-04-16 07:59:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-04-16 07:59:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-04-16 07:59:06,524 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2021-04-16 07:59:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:06,524 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-04-16 07:59:06,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-04-16 07:59:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-04-16 07:59:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-04-16 07:59:06,528 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:06,528 INFO L519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:06,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-16 07:59:06,529 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1121655349, now seen corresponding path program 1 times [2021-04-16 07:59:06,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:06,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67300883] [2021-04-16 07:59:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:06,543 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:06,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:06,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:06,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:06,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:06,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:06,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:06,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:06,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:06,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:06,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-04-16 07:59:06,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67300883] [2021-04-16 07:59:06,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:06,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-16 07:59:06,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537093239] [2021-04-16 07:59:06,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-16 07:59:06,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-16 07:59:06,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-04-16 07:59:06,946 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-04-16 07:59:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:07,668 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2021-04-16 07:59:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-16 07:59:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2021-04-16 07:59:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:07,671 INFO L225 Difference]: With dead ends: 84 [2021-04-16 07:59:07,671 INFO L226 Difference]: Without dead ends: 63 [2021-04-16 07:59:07,672 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 440.4ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-04-16 07:59:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-04-16 07:59:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2021-04-16 07:59:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-04-16 07:59:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-04-16 07:59:07,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2021-04-16 07:59:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:07,698 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-04-16 07:59:07,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-04-16 07:59:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2021-04-16 07:59:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-04-16 07:59:07,699 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:07,699 INFO L519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:07,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-16 07:59:07,700 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:07,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2096379008, now seen corresponding path program 1 times [2021-04-16 07:59:07,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:07,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791870184] [2021-04-16 07:59:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:07,702 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:07,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:07,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:07,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:07,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:07,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:07,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:07,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:07,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791870184] [2021-04-16 07:59:07,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:07,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-16 07:59:07,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319289833] [2021-04-16 07:59:07,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-16 07:59:07,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:07,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-16 07:59:07,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-04-16 07:59:07,847 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:08,253 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-04-16 07:59:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-16 07:59:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2021-04-16 07:59:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:08,255 INFO L225 Difference]: With dead ends: 75 [2021-04-16 07:59:08,255 INFO L226 Difference]: Without dead ends: 73 [2021-04-16 07:59:08,255 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-04-16 07:59:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-04-16 07:59:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2021-04-16 07:59:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-04-16 07:59:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2021-04-16 07:59:08,267 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2021-04-16 07:59:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:08,267 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2021-04-16 07:59:08,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2021-04-16 07:59:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-04-16 07:59:08,269 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:08,269 INFO L519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:08,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-16 07:59:08,269 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 983031743, now seen corresponding path program 1 times [2021-04-16 07:59:08,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:08,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771304518] [2021-04-16 07:59:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:08,272 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:08,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:08,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:08,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:08,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:08,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,390 INFO L142 QuantifierPusher]: treesize reduction 5, result has 86.1 percent of original size [2021-04-16 07:59:08,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-04-16 07:59:08,430 INFO L142 QuantifierPusher]: treesize reduction 6, result has 88.0 percent of original size [2021-04-16 07:59:08,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-04-16 07:59:08,487 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.0 percent of original size [2021-04-16 07:59:08,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-04-16 07:59:08,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:08,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:08,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:08,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:08,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:08,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:08,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:08,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:08,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-04-16 07:59:08,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771304518] [2021-04-16 07:59:08,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:08,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-16 07:59:08,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017431576] [2021-04-16 07:59:08,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-16 07:59:08,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-16 07:59:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-04-16 07:59:08,713 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-04-16 07:59:09,110 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-04-16 07:59:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:09,860 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2021-04-16 07:59:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-04-16 07:59:09,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2021-04-16 07:59:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:09,862 INFO L225 Difference]: With dead ends: 114 [2021-04-16 07:59:09,862 INFO L226 Difference]: Without dead ends: 74 [2021-04-16 07:59:09,863 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 911.4ms TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2021-04-16 07:59:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-04-16 07:59:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2021-04-16 07:59:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-04-16 07:59:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-04-16 07:59:09,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2021-04-16 07:59:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:09,875 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-04-16 07:59:09,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-04-16 07:59:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-04-16 07:59:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-04-16 07:59:09,876 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:09,877 INFO L519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:09,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-16 07:59:09,877 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2045094069, now seen corresponding path program 1 times [2021-04-16 07:59:09,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:09,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [816579776] [2021-04-16 07:59:09,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:09,879 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:09,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:09,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:09,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:09,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:09,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:09,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [816579776] [2021-04-16 07:59:09,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:09,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-16 07:59:09,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936118217] [2021-04-16 07:59:09,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-16 07:59:09,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-16 07:59:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-16 07:59:09,974 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:10,277 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2021-04-16 07:59:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-16 07:59:10,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2021-04-16 07:59:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:10,281 INFO L225 Difference]: With dead ends: 88 [2021-04-16 07:59:10,281 INFO L226 Difference]: Without dead ends: 67 [2021-04-16 07:59:10,285 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 151.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-04-16 07:59:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-04-16 07:59:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-04-16 07:59:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-04-16 07:59:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-04-16 07:59:10,310 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2021-04-16 07:59:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:10,310 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-04-16 07:59:10,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-04-16 07:59:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-16 07:59:10,314 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:10,314 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:10,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-16 07:59:10,314 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash 629236887, now seen corresponding path program 1 times [2021-04-16 07:59:10,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:10,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678884177] [2021-04-16 07:59:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:10,322 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:10,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:10,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:10,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 07:59:10,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:10,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:10,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:10,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:10,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 07:59:10,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-16 07:59:10,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:10,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:10,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-04-16 07:59:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:10,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:10,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:10,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:10,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678884177] [2021-04-16 07:59:10,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:10,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-04-16 07:59:10,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505059533] [2021-04-16 07:59:10,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-04-16 07:59:10,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-04-16 07:59:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-04-16 07:59:10,723 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:11,643 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2021-04-16 07:59:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-16 07:59:11,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2021-04-16 07:59:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:11,650 INFO L225 Difference]: With dead ends: 101 [2021-04-16 07:59:11,650 INFO L226 Difference]: Without dead ends: 87 [2021-04-16 07:59:11,651 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 621.3ms TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2021-04-16 07:59:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-04-16 07:59:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2021-04-16 07:59:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-04-16 07:59:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-04-16 07:59:11,672 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 57 [2021-04-16 07:59:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:11,677 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-04-16 07:59:11,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-04-16 07:59:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-04-16 07:59:11,682 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:11,682 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:11,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-16 07:59:11,683 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:11,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1636680555, now seen corresponding path program 2 times [2021-04-16 07:59:11,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:11,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365149901] [2021-04-16 07:59:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:11,686 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:11,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:11,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:11,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:11,813 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.9 percent of original size [2021-04-16 07:59:11,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-04-16 07:59:11,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:11,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:11,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:11,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:11,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:11,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:11,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:11,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:11,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:11,954 INFO L142 QuantifierPusher]: treesize reduction 34, result has 77.0 percent of original size [2021-04-16 07:59:11,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2021-04-16 07:59:12,016 INFO L142 QuantifierPusher]: treesize reduction 119, result has 50.2 percent of original size [2021-04-16 07:59:12,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 120 [2021-04-16 07:59:12,089 INFO L142 QuantifierPusher]: treesize reduction 139, result has 49.6 percent of original size [2021-04-16 07:59:12,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-04-16 07:59:12,186 INFO L142 QuantifierPusher]: treesize reduction 121, result has 58.8 percent of original size [2021-04-16 07:59:12,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 173 [2021-04-16 07:59:12,317 INFO L142 QuantifierPusher]: treesize reduction 44, result has 48.8 percent of original size [2021-04-16 07:59:12,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-04-16 07:59:12,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:12,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:12,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:12,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:12,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:12,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:12,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:12,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:12,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:12,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:12,464 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-04-16 07:59:12,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-16 07:59:12,499 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-04-16 07:59:12,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-16 07:59:12,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 07:59:12,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-16 07:59:12,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-16 07:59:12,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-16 07:59:12,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:12,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-16 07:59:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-04-16 07:59:12,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365149901] [2021-04-16 07:59:12,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:12,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-04-16 07:59:12,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201742297] [2021-04-16 07:59:12,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-04-16 07:59:12,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-04-16 07:59:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-04-16 07:59:12,638 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-04-16 07:59:13,220 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-04-16 07:59:13,540 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-04-16 07:59:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:14,518 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2021-04-16 07:59:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-04-16 07:59:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2021-04-16 07:59:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:14,520 INFO L225 Difference]: With dead ends: 140 [2021-04-16 07:59:14,520 INFO L226 Difference]: Without dead ends: 102 [2021-04-16 07:59:14,521 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1579.4ms TimeCoverageRelationStatistics Valid=215, Invalid=1507, Unknown=0, NotChecked=0, Total=1722 [2021-04-16 07:59:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-04-16 07:59:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2021-04-16 07:59:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-04-16 07:59:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2021-04-16 07:59:14,538 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2021-04-16 07:59:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:14,538 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2021-04-16 07:59:14,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-04-16 07:59:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2021-04-16 07:59:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-16 07:59:14,539 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:14,539 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:14,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-16 07:59:14,540 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 596047115, now seen corresponding path program 3 times [2021-04-16 07:59:14,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:14,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001772029] [2021-04-16 07:59:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:14,542 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:14,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:14,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:14,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:14,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:14,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-16 07:59:14,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:14,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:14,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001772029] [2021-04-16 07:59:14,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:14,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-16 07:59:14,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501453472] [2021-04-16 07:59:14,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-16 07:59:14,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-16 07:59:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-04-16 07:59:14,651 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:15,170 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2021-04-16 07:59:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-16 07:59:15,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2021-04-16 07:59:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:15,172 INFO L225 Difference]: With dead ends: 129 [2021-04-16 07:59:15,172 INFO L226 Difference]: Without dead ends: 92 [2021-04-16 07:59:15,173 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 324.1ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-04-16 07:59:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-04-16 07:59:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2021-04-16 07:59:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-04-16 07:59:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2021-04-16 07:59:15,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 61 [2021-04-16 07:59:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:15,199 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2021-04-16 07:59:15,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-04-16 07:59:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2021-04-16 07:59:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-16 07:59:15,200 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:15,201 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:15,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-16 07:59:15,201 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash 645513954, now seen corresponding path program 1 times [2021-04-16 07:59:15,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:15,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225392533] [2021-04-16 07:59:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:15,204 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:15,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 07:59:15,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 07:59:15,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:15,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-04-16 07:59:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-04-16 07:59:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:15,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225392533] [2021-04-16 07:59:15,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:15,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-16 07:59:15,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926779972] [2021-04-16 07:59:15,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-16 07:59:15,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:15,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-16 07:59:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-04-16 07:59:15,342 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-04-16 07:59:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:15,746 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2021-04-16 07:59:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-16 07:59:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2021-04-16 07:59:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:15,747 INFO L225 Difference]: With dead ends: 109 [2021-04-16 07:59:15,747 INFO L226 Difference]: Without dead ends: 98 [2021-04-16 07:59:15,747 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 168.0ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-04-16 07:59:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-04-16 07:59:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2021-04-16 07:59:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2021-04-16 07:59:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-04-16 07:59:15,761 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2021-04-16 07:59:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:15,762 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-04-16 07:59:15,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-04-16 07:59:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-04-16 07:59:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-16 07:59:15,763 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:15,763 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:15,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-16 07:59:15,763 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash 643666912, now seen corresponding path program 1 times [2021-04-16 07:59:15,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:15,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193849122] [2021-04-16 07:59:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:15,765 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:15,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:15,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:15,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 07:59:15,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 07:59:15,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:15,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-04-16 07:59:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-04-16 07:59:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:15,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:15,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:15,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193849122] [2021-04-16 07:59:15,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:15,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-16 07:59:15,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30901557] [2021-04-16 07:59:15,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-16 07:59:15,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-16 07:59:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-04-16 07:59:15,901 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-04-16 07:59:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:16,420 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2021-04-16 07:59:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-16 07:59:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2021-04-16 07:59:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:16,421 INFO L225 Difference]: With dead ends: 104 [2021-04-16 07:59:16,421 INFO L226 Difference]: Without dead ends: 102 [2021-04-16 07:59:16,422 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 256.2ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-04-16 07:59:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-04-16 07:59:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2021-04-16 07:59:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2021-04-16 07:59:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2021-04-16 07:59:16,437 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 64 [2021-04-16 07:59:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:16,437 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2021-04-16 07:59:16,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-04-16 07:59:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2021-04-16 07:59:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-16 07:59:16,438 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:16,438 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:16,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-16 07:59:16,439 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -781730101, now seen corresponding path program 1 times [2021-04-16 07:59:16,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:16,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249278488] [2021-04-16 07:59:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:16,441 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:16,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-16 07:59:16,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-16 07:59:16,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:16,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:16,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:16,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:16,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 07:59:16,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:16,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:16,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:16,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:16,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-16 07:59:16,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-16 07:59:16,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 07:59:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:16,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:16,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:16,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:16,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [249278488] [2021-04-16 07:59:16,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:16,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-16 07:59:16,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780412221] [2021-04-16 07:59:16,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-16 07:59:16,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-16 07:59:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-04-16 07:59:16,765 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:17,729 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2021-04-16 07:59:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-04-16 07:59:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2021-04-16 07:59:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:17,731 INFO L225 Difference]: With dead ends: 111 [2021-04-16 07:59:17,731 INFO L226 Difference]: Without dead ends: 109 [2021-04-16 07:59:17,731 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 661.0ms TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2021-04-16 07:59:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-04-16 07:59:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2021-04-16 07:59:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2021-04-16 07:59:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2021-04-16 07:59:17,747 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 66 [2021-04-16 07:59:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2021-04-16 07:59:17,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2021-04-16 07:59:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-16 07:59:17,748 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:17,748 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:17,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-16 07:59:17,748 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash -779883059, now seen corresponding path program 1 times [2021-04-16 07:59:17,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:17,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356509780] [2021-04-16 07:59:17,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:17,750 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:17,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 07:59:17,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 07:59:17,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:17,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:17,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 07:59:17,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 07:59:17,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 07:59:17,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 07:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:17,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:17,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:17,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:17,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356509780] [2021-04-16 07:59:17,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:17,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-16 07:59:17,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144337991] [2021-04-16 07:59:17,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-16 07:59:17,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-16 07:59:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-04-16 07:59:17,942 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:18,657 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2021-04-16 07:59:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-16 07:59:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2021-04-16 07:59:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:18,658 INFO L225 Difference]: With dead ends: 124 [2021-04-16 07:59:18,658 INFO L226 Difference]: Without dead ends: 106 [2021-04-16 07:59:18,659 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 383.2ms TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-04-16 07:59:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-04-16 07:59:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2021-04-16 07:59:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2021-04-16 07:59:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-04-16 07:59:18,673 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 66 [2021-04-16 07:59:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:18,673 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-04-16 07:59:18,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-04-16 07:59:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-04-16 07:59:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-04-16 07:59:18,674 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:18,674 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:18,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-16 07:59:18,674 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 297933182, now seen corresponding path program 1 times [2021-04-16 07:59:18,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:18,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406379514] [2021-04-16 07:59:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:18,676 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:18,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 07:59:18,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 07:59:18,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:18,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 07:59:18,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:18,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:18,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:18,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-16 07:59:18,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-04-16 07:59:18,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 07:59:18,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-04-16 07:59:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:18,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:18,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-04-16 07:59:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-04-16 07:59:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:18,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:18,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:18,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406379514] [2021-04-16 07:59:18,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:18,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-16 07:59:18,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515994723] [2021-04-16 07:59:18,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-16 07:59:18,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-16 07:59:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-04-16 07:59:18,940 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-04-16 07:59:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:19,667 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2021-04-16 07:59:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-16 07:59:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 70 [2021-04-16 07:59:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:19,668 INFO L225 Difference]: With dead ends: 110 [2021-04-16 07:59:19,669 INFO L226 Difference]: Without dead ends: 108 [2021-04-16 07:59:19,669 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 429.7ms TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-04-16 07:59:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-04-16 07:59:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2021-04-16 07:59:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2021-04-16 07:59:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2021-04-16 07:59:19,686 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2021-04-16 07:59:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2021-04-16 07:59:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-04-16 07:59:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2021-04-16 07:59:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-04-16 07:59:19,687 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:19,687 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:19,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-16 07:59:19,687 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1867983073, now seen corresponding path program 4 times [2021-04-16 07:59:19,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:19,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481710077] [2021-04-16 07:59:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:19,689 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:19,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:19,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-04-16 07:59:19,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-04-16 07:59:19,770 INFO L142 QuantifierPusher]: treesize reduction 1499, result has 27.6 percent of original size [2021-04-16 07:59:19,772 INFO L147 QuantifierPusher]: treesize reduction 173, result has 69.8 percent of original size 399 [2021-04-16 07:59:19,820 INFO L142 QuantifierPusher]: treesize reduction 1499, result has 27.6 percent of original size [2021-04-16 07:59:19,821 INFO L147 QuantifierPusher]: treesize reduction 173, result has 69.8 percent of original size 399 [2021-04-16 07:59:19,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:19,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:19,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:19,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:19,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:19,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:19,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:19,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-04-16 07:59:19,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:19,913 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-04-16 07:59:19,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:19,928 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-04-16 07:59:19,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:19,949 INFO L142 QuantifierPusher]: treesize reduction 953, result has 33.7 percent of original size [2021-04-16 07:59:19,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 485 [2021-04-16 07:59:20,036 INFO L142 QuantifierPusher]: treesize reduction 953, result has 33.7 percent of original size [2021-04-16 07:59:20,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 485 [2021-04-16 07:59:20,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:20,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:20,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:20,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:20,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:20,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:20,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:20,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:20,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:20,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:20,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:20,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:20,205 INFO L142 QuantifierPusher]: treesize reduction 19, result has 26.9 percent of original size [2021-04-16 07:59:20,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:20,220 INFO L142 QuantifierPusher]: treesize reduction 130, result has 8.5 percent of original size [2021-04-16 07:59:20,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 07:59:20,239 INFO L142 QuantifierPusher]: treesize reduction 144, result has 37.4 percent of original size [2021-04-16 07:59:20,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-04-16 07:59:20,282 INFO L142 QuantifierPusher]: treesize reduction 114, result has 41.2 percent of original size [2021-04-16 07:59:20,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-04-16 07:59:20,345 INFO L142 QuantifierPusher]: treesize reduction 169, result has 72.7 percent of original size [2021-04-16 07:59:20,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 449 [2021-04-16 07:59:20,625 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-04-16 07:59:20,638 INFO L142 QuantifierPusher]: treesize reduction 165, result has 81.5 percent of original size [2021-04-16 07:59:20,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 725 [2021-04-16 07:59:21,055 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2021-04-16 07:59:21,064 INFO L142 QuantifierPusher]: treesize reduction 161, result has 81.1 percent of original size [2021-04-16 07:59:21,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 691 [2021-04-16 07:59:21,400 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-04-16 07:59:21,406 INFO L142 QuantifierPusher]: treesize reduction 1175, result has 47.4 percent of original size [2021-04-16 07:59:21,408 INFO L147 QuantifierPusher]: treesize reduction 94, result has 91.1 percent of original size 964 [2021-04-16 07:59:21,747 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2021-04-16 07:59:21,752 INFO L142 QuantifierPusher]: treesize reduction 1175, result has 47.4 percent of original size [2021-04-16 07:59:21,759 INFO L147 QuantifierPusher]: treesize reduction 94, result has 91.1 percent of original size 964 [2021-04-16 07:59:21,785 INFO L142 QuantifierPusher]: treesize reduction 2336, result has 32.9 percent of original size [2021-04-16 07:59:21,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1143 [2021-04-16 07:59:22,034 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2021-04-16 07:59:22,041 INFO L142 QuantifierPusher]: treesize reduction 1569, result has 41.0 percent of original size [2021-04-16 07:59:22,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1089 [2021-04-16 07:59:22,246 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2021-04-16 07:59:22,265 INFO L142 QuantifierPusher]: treesize reduction 1085, result has 38.0 percent of original size [2021-04-16 07:59:22,266 INFO L147 QuantifierPusher]: treesize reduction 75, result has 88.7 percent of original size 591 [2021-04-16 07:59:22,394 INFO L142 QuantifierPusher]: treesize reduction 1447, result has 16.4 percent of original size [2021-04-16 07:59:22,395 INFO L147 QuantifierPusher]: treesize reduction 142, result has 50.0 percent of original size 142 [2021-04-16 07:59:22,481 INFO L142 QuantifierPusher]: treesize reduction 1447, result has 16.4 percent of original size [2021-04-16 07:59:22,481 INFO L147 QuantifierPusher]: treesize reduction 142, result has 50.0 percent of original size 142 [2021-04-16 07:59:22,567 INFO L142 QuantifierPusher]: treesize reduction 1582, result has 7.9 percent of original size [2021-04-16 07:59:22,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 136 [2021-04-16 07:59:22,681 INFO L142 QuantifierPusher]: treesize reduction 1440, result has 16.2 percent of original size [2021-04-16 07:59:22,682 INFO L147 QuantifierPusher]: treesize reduction 142, result has 48.9 percent of original size 136 [2021-04-16 07:59:22,732 INFO L142 QuantifierPusher]: treesize reduction 1582, result has 7.9 percent of original size [2021-04-16 07:59:22,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 136 [2021-04-16 07:59:22,734 INFO L142 QuantifierPusher]: treesize reduction 1440, result has 16.2 percent of original size [2021-04-16 07:59:22,735 INFO L147 QuantifierPusher]: treesize reduction 142, result has 48.9 percent of original size 136 [2021-04-16 07:59:22,788 INFO L142 QuantifierPusher]: treesize reduction 1582, result has 7.9 percent of original size [2021-04-16 07:59:22,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 136 [2021-04-16 07:59:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-04-16 07:59:22,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481710077] [2021-04-16 07:59:22,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:22,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-04-16 07:59:22,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701719939] [2021-04-16 07:59:22,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-04-16 07:59:22,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-04-16 07:59:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2021-04-16 07:59:22,792 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-04-16 07:59:24,193 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2021-04-16 07:59:24,623 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 122 [2021-04-16 07:59:25,110 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2021-04-16 07:59:25,578 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2021-04-16 07:59:26,301 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2021-04-16 07:59:26,487 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2021-04-16 07:59:26,767 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2021-04-16 07:59:27,068 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2021-04-16 07:59:27,310 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2021-04-16 07:59:27,614 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2021-04-16 07:59:27,869 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2021-04-16 07:59:28,338 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2021-04-16 07:59:28,710 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2021-04-16 07:59:29,181 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2021-04-16 07:59:29,650 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 95 [2021-04-16 07:59:30,040 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 112 [2021-04-16 07:59:30,653 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 119 [2021-04-16 07:59:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:30,988 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2021-04-16 07:59:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-04-16 07:59:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2021-04-16 07:59:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:30,990 INFO L225 Difference]: With dead ends: 151 [2021-04-16 07:59:30,990 INFO L226 Difference]: Without dead ends: 93 [2021-04-16 07:59:30,991 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 9129.7ms TimeCoverageRelationStatistics Valid=692, Invalid=3214, Unknown=0, NotChecked=0, Total=3906 [2021-04-16 07:59:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-04-16 07:59:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-04-16 07:59:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-04-16 07:59:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-04-16 07:59:31,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 67 [2021-04-16 07:59:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:31,009 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-04-16 07:59:31,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-04-16 07:59:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-04-16 07:59:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-04-16 07:59:31,010 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:31,010 INFO L519 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:31,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-16 07:59:31,010 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:31,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash 680409498, now seen corresponding path program 1 times [2021-04-16 07:59:31,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:31,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777898947] [2021-04-16 07:59:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:31,012 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:31,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:31,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-16 07:59:31,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-16 07:59:31,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-16 07:59:31,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-16 07:59:31,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-16 07:59:31,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-16 07:59:31,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:31,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:31,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:31,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,243 INFO L142 QuantifierPusher]: treesize reduction 3, result has 95.8 percent of original size [2021-04-16 07:59:31,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-04-16 07:59:31,325 INFO L142 QuantifierPusher]: treesize reduction 10, result has 91.3 percent of original size [2021-04-16 07:59:31,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 105 [2021-04-16 07:59:31,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-04-16 07:59:31,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-04-16 07:59:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:31,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:31,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-04-16 07:59:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-04-16 07:59:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-04-16 07:59:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:31,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:31,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-04-16 07:59:31,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777898947] [2021-04-16 07:59:31,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:31,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-16 07:59:31,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781440144] [2021-04-16 07:59:31,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-16 07:59:31,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-16 07:59:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-04-16 07:59:31,457 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-04-16 07:59:31,920 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2021-04-16 07:59:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:32,469 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2021-04-16 07:59:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-04-16 07:59:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 76 [2021-04-16 07:59:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:32,470 INFO L225 Difference]: With dead ends: 94 [2021-04-16 07:59:32,470 INFO L226 Difference]: Without dead ends: 76 [2021-04-16 07:59:32,471 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 767.6ms TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2021-04-16 07:59:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-04-16 07:59:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-04-16 07:59:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-04-16 07:59:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-04-16 07:59:32,487 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 76 [2021-04-16 07:59:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:32,487 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-04-16 07:59:32,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-04-16 07:59:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-04-16 07:59:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-16 07:59:32,488 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:32,488 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:32,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-16 07:59:32,488 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1166734282, now seen corresponding path program 1 times [2021-04-16 07:59:32,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:32,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125693755] [2021-04-16 07:59:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:32,490 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:32,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-16 07:59:32,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-16 07:59:32,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-16 07:59:32,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 07:59:32,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:32,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:32,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:32,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 07:59:32,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-16 07:59:32,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 07:59:32,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 07:59:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:32,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:32,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-04-16 07:59:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-04-16 07:59:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:32,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:32,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-04-16 07:59:32,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [125693755] [2021-04-16 07:59:32,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:32,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-16 07:59:32,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900204721] [2021-04-16 07:59:32,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-16 07:59:32,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:32,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-16 07:59:32,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-04-16 07:59:32,749 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-04-16 07:59:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:33,292 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2021-04-16 07:59:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-16 07:59:33,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2021-04-16 07:59:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:33,294 INFO L225 Difference]: With dead ends: 79 [2021-04-16 07:59:33,294 INFO L226 Difference]: Without dead ends: 77 [2021-04-16 07:59:33,294 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 405.7ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-04-16 07:59:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-04-16 07:59:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2021-04-16 07:59:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-04-16 07:59:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-04-16 07:59:33,309 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 79 [2021-04-16 07:59:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:33,309 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-04-16 07:59:33,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-04-16 07:59:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-04-16 07:59:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-04-16 07:59:33,310 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 07:59:33,310 INFO L519 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 07:59:33,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-16 07:59:33,310 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 07:59:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 07:59:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 690301670, now seen corresponding path program 1 times [2021-04-16 07:59:33,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 07:59:33,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1126964497] [2021-04-16 07:59:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 07:59:33,312 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 07:59:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:33,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:33,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 07:59:33,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:33,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:33,430 INFO L142 QuantifierPusher]: treesize reduction 392, result has 9.0 percent of original size [2021-04-16 07:59:33,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-16 07:59:33,446 INFO L142 QuantifierPusher]: treesize reduction 392, result has 10.5 percent of original size [2021-04-16 07:59:33,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-04-16 07:59:33,467 INFO L142 QuantifierPusher]: treesize reduction 166, result has 67.6 percent of original size [2021-04-16 07:59:33,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 347 [2021-04-16 07:59:33,597 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2021-04-16 07:59:33,599 INFO L142 QuantifierPusher]: treesize reduction 166, result has 67.6 percent of original size [2021-04-16 07:59:33,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 347 [2021-04-16 07:59:33,731 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2021-04-16 07:59:33,733 INFO L142 QuantifierPusher]: treesize reduction 166, result has 67.1 percent of original size [2021-04-16 07:59:33,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 338 [2021-04-16 07:59:33,838 INFO L142 QuantifierPusher]: treesize reduction 166, result has 67.1 percent of original size [2021-04-16 07:59:33,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 338 [2021-04-16 07:59:33,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:33,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:33,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:33,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:33,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 07:59:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:33,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:33,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:33,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:33,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-04-16 07:59:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:33,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:33,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-04-16 07:59:33,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-04-16 07:59:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:33,982 INFO L142 QuantifierPusher]: treesize reduction 34, result has 17.1 percent of original size [2021-04-16 07:59:33,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-16 07:59:34,003 INFO L142 QuantifierPusher]: treesize reduction 19, result has 44.1 percent of original size [2021-04-16 07:59:34,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 07:59:34,031 INFO L142 QuantifierPusher]: treesize reduction 992, result has 24.2 percent of original size [2021-04-16 07:59:34,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 316 [2021-04-16 07:59:34,116 INFO L142 QuantifierPusher]: treesize reduction 992, result has 24.2 percent of original size [2021-04-16 07:59:34,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 316 [2021-04-16 07:59:34,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-04-16 07:59:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:34,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-04-16 07:59:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:34,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-04-16 07:59:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:34,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:34,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-04-16 07:59:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,192 INFO L142 QuantifierPusher]: treesize reduction 14, result has 81.8 percent of original size [2021-04-16 07:59:34,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 07:59:34,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 138 [2021-04-16 07:59:34,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-04-16 07:59:34,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 07:59:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 07:59:34,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 07:59:34,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-04-16 07:59:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:34,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-04-16 07:59:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:34,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-04-16 07:59:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 07:59:34,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 07:59:34,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 07:59:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-04-16 07:59:34,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1126964497] [2021-04-16 07:59:34,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 07:59:34,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-04-16 07:59:34,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229472836] [2021-04-16 07:59:34,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-04-16 07:59:34,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 07:59:34,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-04-16 07:59:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2021-04-16 07:59:34,444 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2021-04-16 07:59:35,449 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2021-04-16 07:59:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 07:59:36,286 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-04-16 07:59:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-04-16 07:59:36,287 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 85 [2021-04-16 07:59:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 07:59:36,287 INFO L225 Difference]: With dead ends: 75 [2021-04-16 07:59:36,287 INFO L226 Difference]: Without dead ends: 0 [2021-04-16 07:59:36,288 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1770.1ms TimeCoverageRelationStatistics Valid=207, Invalid=1685, Unknown=0, NotChecked=0, Total=1892 [2021-04-16 07:59:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-04-16 07:59:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-04-16 07:59:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-16 07:59:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-04-16 07:59:36,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-04-16 07:59:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 07:59:36,289 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-04-16 07:59:36,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2021-04-16 07:59:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-04-16 07:59:36,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-04-16 07:59:36,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-16 07:59:36,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-04-16 07:59:36,464 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 213 [2021-04-16 07:59:37,176 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 213 [2021-04-16 07:59:37,307 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 245 [2021-04-16 07:59:38,113 WARN L205 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 113 [2021-04-16 07:59:38,457 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-04-16 07:59:38,701 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-04-16 07:59:38,840 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2021-04-16 07:59:40,000 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 179 DAG size of output: 134 [2021-04-16 07:59:40,337 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2021-04-16 07:59:40,482 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2021-04-16 07:59:40,698 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-04-16 07:59:40,911 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-04-16 07:59:41,263 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2021-04-16 07:59:42,925 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 194 DAG size of output: 141 [2021-04-16 07:59:44,090 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2021-04-16 07:59:44,330 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-04-16 07:59:44,488 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2021-04-16 07:59:44,705 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2021-04-16 07:59:44,948 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2021-04-16 07:59:45,226 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-04-16 07:59:45,883 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 113 [2021-04-16 07:59:46,127 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-04-16 07:59:46,333 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2021-04-16 07:59:49,074 WARN L205 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 225 DAG size of output: 153 [2021-04-16 07:59:49,311 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2021-04-16 07:59:49,374 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2021-04-16 07:59:49,374 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2021-04-16 07:59:49,374 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2021-04-16 07:59:49,374 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,374 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-04-16 07:59:49,374 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,374 INFO L194 CegarLoopUtils]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-04-16 07:59:49,375 INFO L194 CegarLoopUtils]: At program point finddupEXIT(lines 33 46) the Hoare annotation is: (let ((.cse13 (<= 1 finddup_~j~1)) (.cse6 (= finddup_~i~1 0)) (.cse12 (<= 1 finddup_~i~1)) (.cse15 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse10 (<= |finddup_#res| 1)) (.cse16 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse17 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse19 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse22 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse23 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse9 (<= 1 |finddup_#res|)) (.cse14 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse7 (select |#memory_int| |finddup_#in~a.base|)) (.cse24 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse21 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse3 (<= finddup_~n 1)) (.cse5 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (let ((.cse29 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse21 .cse29))) (let ((.cse28 (store .cse21 .cse30 0))) (let ((.cse31 (@diff .cse28 .cse29))) (or (and (not (= .cse28 .cse29)) (not (= (select .cse21 .cse30) (select .cse21 .cse31)))) (not (= .cse29 (store .cse28 .cse31 0))))))))) (.cse11 (<= finddup_~j~1 1)) (.cse8 (select .cse7 (* .cse24 4))) (.cse1 (let ((.cse25 (<= 1 .cse24)) (.cse26 (<= (+ .cse24 1) |finddup_#in~n|)) (.cse27 (<= (+ finddup_~j~1 1) |finddup_#in~n|))) (or (and .cse13 .cse15 .cse10 .cse16 .cse17 .cse25 .cse4 (or (= .cse22 0) .cse23) .cse9 .cse14 .cse26 .cse6 .cse27) (and (or (<= (+ .cse22 2) |finddup_#in~n|) .cse23) .cse12 .cse15 .cse10 .cse16 .cse17 .cse19 .cse25 .cse4 (or (<= 1 .cse22) .cse23) .cse9 .cse14 .cse26 .cse27)))) (.cse18 (not (= (select .cse21 |finddup_#in~a.offset|) (select .cse21 (+ |finddup_#in~a.offset| 4))))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse20 (<= finddup_~n 2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse1 (= finddup_~a.offset |finddup_#in~a.offset|) .cse6 (= (select .cse7 0) .cse8)) (and .cse9 (<= finddup_~i~1 0) .cse3 .cse10 .cse4 .cse11) (and .cse5 .cse12 .cse13 .cse2 .cse14 .cse15 .cse0 .cse16 .cse17 .cse4) (and .cse18 .cse9 .cse10 .cse19 .cse4 .cse11 .cse20) (and (or (and (= .cse7 .cse21) (= (select .cse7 (* .cse22 4)) .cse8)) (= |finddup_#in~_i.base| |finddup_#in~a.base|) .cse23 (= |finddup_#in~_j.base| |finddup_#in~a.base|) (not (= |finddup_#in~a.offset| 0))) (or .cse23 (<= (+ .cse22 1) .cse24)) .cse1) (and .cse18 .cse2 (<= finddup_~j~1 2) .cse4 .cse20)))) [2021-04-16 07:59:49,375 INFO L194 CegarLoopUtils]: At program point L38(lines 38 42) the Hoare annotation is: (let ((.cse27 (* finddup_~j~1 4))) (let ((.cse21 ((as const (Array Int Int)) 0)) (.cse38 (* finddup_~i~1 4)) (.cse24 (select |#memory_int| finddup_~a.base)) (.cse44 (+ .cse27 finddup_~a.offset))) (let ((.cse28 (select .cse24 .cse44)) (.cse26 (select .cse24 (+ finddup_~a.offset .cse38))) (.cse25 (@diff .cse24 .cse21))) (let ((.cse20 (store .cse24 .cse25 0)) (.cse36 (= .cse26 0)) (.cse17 (= .cse28 0))) (let ((.cse23 (not .cse17)) (.cse19 (not .cse36)) (.cse35 (and (= |finddup_#t~mem14| .cse28) (= |finddup_#t~mem13| .cse26))) (.cse40 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse33 (@diff .cse20 .cse21)) (.cse6 (<= 1 finddup_~i~1)) (.cse11 (= |finddup_#in~a.base| finddup_~a.base)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse12 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse7 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse8 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse9 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse34 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse14 (<= (+ finddup_~j~1 1) |finddup_#in~n|)) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse45 (+ finddup_~i~1 2))) (let ((.cse16 (let ((.cse46 (<= .cse45 finddup_~j~1))) (or (and .cse6 .cse2 .cse12 .cse7 .cse8 .cse9 .cse14 .cse46 .cse4) (and .cse11 .cse2 .cse12 .cse7 .cse8 .cse9 .cse34 (<= 0 finddup_~i~1) .cse14 .cse4 .cse46)))) (.cse18 (= .cse44 (+ .cse25 4))) (.cse29 (< .cse45 finddup_~j~1)) (.cse22 (= .cse44 (+ .cse33 4))) (.cse13 (let ((.cse42 (@diff .cse40 .cse21))) (let ((.cse41 (store .cse40 .cse42 0))) (let ((.cse43 (@diff .cse41 .cse21))) (or (and (not (= .cse41 .cse21)) (not (= (select .cse40 .cse42) (select .cse40 .cse43)))) (not (= .cse21 (store .cse41 .cse43 0)))))))) (.cse32 (or .cse17 .cse35 (< (+ finddup_~i~1 3) finddup_~n))) (.cse0 (select .cse40 |finddup_#in~a.offset|)) (.cse1 (select .cse40 (+ |finddup_#in~a.offset| 4))) (.cse5 (<= finddup_~j~1 1)) (.cse30 (or (let ((.cse37 (select (let ((.cse39 (store |#memory_int| finddup_~_i.base (store (select |#memory_int| finddup_~_i.base) finddup_~_i.offset finddup_~i~1)))) (store .cse39 finddup_~_j.base (store (select .cse39 finddup_~_j.base) finddup_~_j.offset finddup_~j~1))) |finddup_#in~a.base|))) (and (= |finddup_#t~mem14| (select .cse37 .cse27)) (= (select .cse37 .cse38) |finddup_#t~mem13|))) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (not (= |finddup_#in~a.offset| 0)))) (.cse31 (or (= finddup_~a.offset 0) .cse34)) (.cse3 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse10 (or .cse17 .cse35 .cse36)) (.cse15 (or .cse23 .cse19 (= |finddup_#t~mem14| |finddup_#t~mem13|)))) (or (and (not (= .cse0 .cse1)) .cse2 .cse3 .cse4 .cse5 (<= finddup_~n 2)) (and (<= finddup_~i~1 0) .cse2 (<= finddup_~n 1) .cse4 .cse5) (and .cse6 .cse2 .cse7 .cse8 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse11 .cse16 (or (and (or .cse17 .cse18 .cse19 (and (not (= .cse20 .cse21)) .cse22)) (or .cse23 (not (= (select .cse24 .cse25) .cse26)) (= (select .cse24 (+ .cse27 finddup_~a.offset (- 4))) .cse28)) (not (= .cse21 .cse24))) .cse29) .cse30 .cse31 .cse32 .cse10 .cse15) (and .cse11 .cse16 (or .cse17 .cse18 .cse29 (not (= .cse21 (store .cse20 .cse33 0))) .cse22) .cse13 .cse32 .cse10 .cse15) (and .cse2 .cse7 (= |finddup_#t~mem13| .cse0) .cse8 .cse9 .cse3 .cse4 .cse11 (= |finddup_#t~mem14| .cse1) .cse12 .cse34 (= finddup_~i~1 0) .cse5) (and .cse6 .cse30 .cse2 .cse31 .cse7 .cse8 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse14 (or (= .cse26 .cse28) (<= (+ finddup_~j~1 2) finddup_~n)) .cse15)))))))) [2021-04-16 07:59:49,376 INFO L194 CegarLoopUtils]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse11 (select |#memory_int| finddup_~a.base)) (.cse9 ((as const (Array Int Int)) 0))) (let ((.cse12 (@diff .cse11 .cse9))) (let ((.cse8 (store .cse11 .cse12 0)) (.cse14 (* finddup_~j~1 4))) (let ((.cse39 (+ .cse14 finddup_~a.offset)) (.cse32 (@diff .cse8 .cse9))) (let ((.cse1 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse33 (* finddup_~n 4)) (.cse13 (select .cse11 (+ finddup_~a.offset (* finddup_~i~1 4)))) (.cse30 (+ .cse32 4)) (.cse37 (+ finddup_~i~1 2)) (.cse31 (+ .cse12 4)) (.cse15 (select .cse11 .cse39)) (.cse38 (+ finddup_~i~1 3)) (.cse40 (+ finddup_~i~1 1))) (let ((.cse0 (<= .cse40 finddup_~n)) (.cse3 (<= .cse40 finddup_~j~1)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse17 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse18 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse19 (<= .cse38 finddup_~n)) (.cse20 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse5 (= .cse15 0)) (.cse6 (= .cse39 .cse31)) (.cse16 (< .cse37 finddup_~j~1)) (.cse10 (= .cse39 .cse30)) (.cse24 (< .cse38 finddup_~n)) (.cse7 (not (= .cse13 0))) (.cse25 (= (select .cse11 (+ .cse33 finddup_~a.offset (- 4))) (select .cse11 (+ .cse33 finddup_~a.offset (- 8))))) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse21 (<= .cse37 finddup_~j~1)) (.cse22 (= |finddup_#in~a.base| finddup_~a.base)) (.cse23 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse27 (let ((.cse35 (@diff .cse1 .cse9))) (let ((.cse34 (store .cse1 .cse35 0))) (let ((.cse36 (@diff .cse34 .cse9))) (or (and (not (= .cse34 .cse9)) (not (= (select .cse1 .cse35) (select .cse1 .cse36)))) (not (= .cse9 (store .cse34 .cse36 0)))))))) (.cse26 (<= 0 finddup_~i~1))) (or (and .cse0 (not (= (select .cse1 |finddup_#in~a.offset|) (select .cse1 (+ |finddup_#in~a.offset| 4)))) .cse2 (<= finddup_~j~1 2) .cse3 .cse4 (<= finddup_~n 2)) (and (or (and (or .cse5 .cse6 .cse7 (and (not (= .cse8 .cse9)) .cse10)) (or (not .cse5) (not (= (select .cse11 .cse12) .cse13)) (= (select .cse11 (+ .cse14 finddup_~a.offset (- 4))) .cse15)) (not (= .cse9 .cse11))) .cse16) .cse2 (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)) .cse17 .cse18 .cse19 .cse20 .cse4 .cse21 .cse22 .cse23 (or .cse24 .cse25) .cse26) (and .cse22 .cse0 (<= 1 finddup_~i~1) .cse2 .cse23 .cse17 .cse27 .cse18 .cse20 .cse3 .cse4) (and (<= finddup_~i~1 0) .cse2 (<= finddup_~n 1) .cse4) (let ((.cse28 (not (= .cse9 (store .cse8 .cse32 0))))) (and .cse2 .cse17 .cse18 .cse19 .cse20 (or .cse5 .cse6 .cse7 .cse16 .cse28 .cse10) (let ((.cse29 (+ .cse33 finddup_~a.offset))) (or .cse24 .cse7 .cse25 (and (= (+ .cse12 8) .cse29) (= .cse30 .cse29)) (and (= .cse31 .cse29) (= (+ .cse32 8) .cse29)) .cse28)) .cse4 .cse21 .cse22 .cse23 .cse27 .cse26))))))))) [2021-04-16 07:59:49,376 INFO L194 CegarLoopUtils]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse3 (<= 1 finddup_~i~1)) (.cse8 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse2 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse11 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse12 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse14 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse1 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 (<= finddup_~n 1) .cse1) (and .cse2 .cse3 (<= 1 finddup_~j~1) .cse0 .cse4 .cse5 (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse9 (@diff .cse8 .cse7))) (let ((.cse6 (store .cse8 .cse9 0))) (let ((.cse10 (@diff .cse6 .cse7))) (or (and (not (= .cse6 .cse7)) (not (= (select .cse8 .cse9) (select .cse8 .cse10)))) (not (= .cse7 (store .cse6 .cse10 0)))))))) .cse11 .cse12 .cse1) (and .cse2 .cse3 (or (<= (+ finddup_~i~1 3) finddup_~n) (let ((.cse13 (select |#memory_int| finddup_~a.base))) (= (select .cse13 (+ finddup_~a.offset (* finddup_~i~1 4))) (select .cse13 (+ (* finddup_~n 4) finddup_~a.offset (- 4)))))) .cse0 (<= (+ finddup_~i~1 2) finddup_~n) (or (= finddup_~a.offset 0) .cse14) .cse4 .cse5 .cse11 .cse12 (<= (+ finddup_~i~1 1) finddup_~j~1) .cse1) (and (not (= (select .cse8 |finddup_#in~a.offset|) (select .cse8 (+ |finddup_#in~a.offset| 4)))) .cse0 (<= finddup_~j~1 2) .cse1 (<= finddup_~n 2)) (and .cse2 .cse0 .cse4 .cse5 .cse11 .cse12 .cse14 (= finddup_~i~1 0) .cse1))) [2021-04-16 07:59:49,376 INFO L194 CegarLoopUtils]: At program point L36-4(lines 36 44) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 (<= finddup_~n 1) .cse1) (and (= |finddup_#in~a.base| finddup_~a.base) (<= 1 finddup_~i~1) (<= 1 finddup_~j~1) .cse0 (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_j.base| finddup_~_j.base) (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse5 (@diff .cse4 .cse3))) (let ((.cse2 (store .cse4 .cse5 0))) (let ((.cse6 (@diff .cse2 .cse3))) (or (and (not (= .cse2 .cse3)) (not (= (select .cse4 .cse5) (select .cse4 .cse6)))) (not (= .cse3 (store .cse2 .cse6 0)))))))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.offset| finddup_~_i.offset) .cse1) (and (not (= (select .cse4 |finddup_#in~a.offset|) (select .cse4 (+ |finddup_#in~a.offset| 4)))) .cse0 (<= finddup_~j~1 2) .cse1 (<= finddup_~n 2)))) [2021-04-16 07:59:49,377 INFO L194 CegarLoopUtils]: At program point finddupFINAL(lines 33 46) the Hoare annotation is: (let ((.cse13 (<= 1 finddup_~j~1)) (.cse6 (= finddup_~i~1 0)) (.cse12 (<= 1 finddup_~i~1)) (.cse15 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse10 (<= |finddup_#res| 1)) (.cse16 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse17 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse19 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse22 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse23 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse9 (<= 1 |finddup_#res|)) (.cse14 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse7 (select |#memory_int| |finddup_#in~a.base|)) (.cse24 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse21 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse3 (<= finddup_~n 1)) (.cse5 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (let ((.cse29 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse21 .cse29))) (let ((.cse28 (store .cse21 .cse30 0))) (let ((.cse31 (@diff .cse28 .cse29))) (or (and (not (= .cse28 .cse29)) (not (= (select .cse21 .cse30) (select .cse21 .cse31)))) (not (= .cse29 (store .cse28 .cse31 0))))))))) (.cse11 (<= finddup_~j~1 1)) (.cse8 (select .cse7 (* .cse24 4))) (.cse1 (let ((.cse25 (<= 1 .cse24)) (.cse26 (<= (+ .cse24 1) |finddup_#in~n|)) (.cse27 (<= (+ finddup_~j~1 1) |finddup_#in~n|))) (or (and .cse13 .cse15 .cse10 .cse16 .cse17 .cse25 .cse4 (or (= .cse22 0) .cse23) .cse9 .cse14 .cse26 .cse6 .cse27) (and (or (<= (+ .cse22 2) |finddup_#in~n|) .cse23) .cse12 .cse15 .cse10 .cse16 .cse17 .cse19 .cse25 .cse4 (or (<= 1 .cse22) .cse23) .cse9 .cse14 .cse26 .cse27)))) (.cse18 (not (= (select .cse21 |finddup_#in~a.offset|) (select .cse21 (+ |finddup_#in~a.offset| 4))))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse20 (<= finddup_~n 2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse1 (= finddup_~a.offset |finddup_#in~a.offset|) .cse6 (= (select .cse7 0) .cse8)) (and .cse9 (<= finddup_~i~1 0) .cse3 .cse10 .cse4 .cse11) (and .cse5 .cse12 .cse13 .cse2 .cse14 .cse15 .cse0 .cse16 .cse17 .cse4) (and .cse18 .cse9 .cse10 .cse19 .cse4 .cse11 .cse20) (and (or (and (= .cse7 .cse21) (= (select .cse7 (* .cse22 4)) .cse8)) (= |finddup_#in~_i.base| |finddup_#in~a.base|) .cse23 (= |finddup_#in~_j.base| |finddup_#in~a.base|) (not (= |finddup_#in~a.offset| 0))) (or .cse23 (<= (+ .cse22 1) .cse24)) .cse1) (and .cse18 .cse2 (<= finddup_~j~1 2) .cse4 .cse20)))) [2021-04-16 07:59:49,377 INFO L194 CegarLoopUtils]: At program point L37-2(lines 37 43) the Hoare annotation is: (let ((.cse24 (* finddup_~j~1 4))) (let ((.cse17 (+ .cse24 finddup_~a.offset)) (.cse23 (select |#memory_int| finddup_~a.base))) (let ((.cse7 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse19 (select .cse23 (+ finddup_~a.offset (* finddup_~i~1 4)))) (.cse25 (select .cse23 .cse17)) (.cse27 (= finddup_~a.offset |finddup_#in~a.offset|))) (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse1 (<= 1 finddup_~i~1)) (.cse13 (<= (+ finddup_~j~1 1) |finddup_#in~n|)) (.cse16 (or (= finddup_~a.offset 0) .cse27)) (.cse14 (not (= .cse19 .cse25))) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse29 (not (= (select .cse7 |finddup_#in~a.offset|) (select .cse7 (+ |finddup_#in~a.offset| 4))))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse10 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse11 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse12 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse15 (= |finddup_#in~n| finddup_~n)) (.cse30 (<= finddup_~j~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse8 (@diff .cse7 .cse6))) (let ((.cse5 (store .cse7 .cse8 0))) (let ((.cse9 (@diff .cse5 .cse6))) (or (and (not (= .cse5 .cse6)) (not (= (select .cse7 .cse8) (select .cse7 .cse9)))) (not (= .cse6 (store .cse5 .cse9 0))))))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse10 .cse11 .cse12 (<= (+ finddup_~j~1 2) finddup_~n) .cse14 .cse15) (let ((.cse26 (+ finddup_~i~1 2))) (and .cse0 (or (let ((.cse18 (@diff .cse23 .cse6))) (let ((.cse20 (store .cse23 .cse18 0))) (let ((.cse21 (@diff .cse20 .cse6))) (let ((.cse22 (not (= .cse6 (store .cse20 .cse21 0))))) (and (or (= .cse17 (+ .cse18 4)) (not (= .cse19 0)) (and (not (= .cse20 .cse6)) (= .cse17 (+ .cse21 4))) .cse22) (or (not (= (select .cse23 .cse18) .cse19)) (not (= .cse19 (select .cse23 .cse21))) .cse22 (= (select .cse23 (+ .cse24 finddup_~a.offset (- 4))) .cse25))))))) (< .cse26 finddup_~j~1)) (let ((.cse28 (<= .cse26 finddup_~j~1))) (or (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse27 (<= 0 finddup_~i~1) .cse13 .cse15 .cse28) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse28 .cse15))) .cse16 .cse14)) (and .cse29 .cse2 .cse12 .cse15 .cse30 (<= finddup_~n 2)) (and (<= finddup_~i~1 0) .cse2 (<= finddup_~n 1) .cse15 .cse30) (and .cse0 .cse29 .cse2 .cse3 .cse4 .cse10 .cse11 .cse27 .cse12 (= finddup_~i~1 0) .cse15 .cse30)))))) [2021-04-16 07:59:49,377 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse34 (* finddup_~j~1 4)) (.cse15 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse29 (select |#memory_int| finddup_~a.base)) (.cse33 (+ finddup_~i~1 2)) (.cse35 (+ finddup_~i~1 1)) (.cse20 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse13 (not (= (select .cse20 |finddup_#in~a.offset|) (select .cse20 (+ |finddup_#in~a.offset| 4))))) (.cse14 (<= finddup_~j~1 2)) (.cse12 (<= .cse35 finddup_~n)) (.cse1 (<= 1 finddup_~i~1)) (.cse17 (<= .cse33 finddup_~j~1)) (.cse9 (select .cse29 (+ finddup_~a.offset (* finddup_~i~1 4)))) (.cse3 (or (= finddup_~a.offset 0) .cse15)) (.cse10 (select .cse29 (+ .cse34 finddup_~a.offset))) (.cse19 ((as const (Array Int Int)) 0)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse6 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse7 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse8 (<= .cse35 finddup_~j~1)) (.cse16 (= finddup_~i~1 0)) (.cse11 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 .cse1 (<= (+ finddup_~j~1 1) finddup_~n) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (= .cse9 .cse10) (<= (+ finddup_~j~1 2) finddup_~n)) .cse11) (and .cse12 .cse13 .cse2 .cse14 .cse8 .cse11 (<= finddup_~n 2)) (and .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse17 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 (let ((.cse21 (@diff .cse20 .cse19))) (let ((.cse18 (store .cse20 .cse21 0))) (let ((.cse22 (@diff .cse18 .cse19))) (or (and (not (= .cse18 .cse19)) (not (= (select .cse20 .cse21) (select .cse20 .cse22)))) (not (= .cse19 (store .cse18 .cse22 0))))))) .cse6 .cse7 .cse8 .cse11) (and (<= finddup_~i~1 0) .cse2 (<= finddup_~n 1) .cse11) (let ((.cse25 (@diff .cse29 .cse19))) (let ((.cse30 (store .cse29 .cse25 0))) (let ((.cse28 (@diff .cse30 .cse19))) (let ((.cse24 (+ finddup_~i~1 3)) (.cse32 (not (= .cse19 (store .cse30 .cse28 0))))) (and .cse0 (let ((.cse23 (<= .cse24 finddup_~n))) (or (and .cse1 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse17 .cse11) (and .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse15 .cse16 .cse17 .cse11))) (let ((.cse31 (* finddup_~n 4))) (let ((.cse27 (not (= .cse9 (select .cse29 .cse28)))) (.cse26 (+ .cse31 finddup_~a.offset))) (or (and (= (+ .cse25 8) .cse26) .cse27 (= (+ .cse28 4) .cse26)) (< .cse24 finddup_~n) (and (or (not (= (select .cse29 .cse25) .cse9)) .cse27) (not (= .cse9 0))) (and (not (= .cse30 .cse19)) (= (+ .cse25 4) .cse26) (= (+ .cse28 8) .cse26)) (= (select .cse29 (+ .cse31 finddup_~a.offset (- 4))) (select .cse29 (+ .cse31 finddup_~a.offset (- 8)))) .cse32))) .cse3 (or (< .cse33 finddup_~j~1) (and (or .cse32 (= (select .cse29 (+ .cse34 finddup_~a.offset (- 4))) .cse10)) (not (= .cse19 .cse29))))))))) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse16 .cse11 (<= finddup_~j~1 1))))) [2021-04-16 07:59:49,377 INFO L194 CegarLoopUtils]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point mkdupFINAL(lines 19 31) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse3 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse9 (@diff .cse5 .cse3))) (let ((.cse1 (= mkdup_~a.base |mkdup_#in~a.base|)) (.cse0 (= (* mkdup_~i~0 4) 0)) (.cse4 (select .cse3 .cse9))) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (or (not .cse0) .cse1) (or (= mkdup_~j~0 0) (< 0 mkdup_~j~0)) (or (not (let ((.cse2 ((as const (Array Int Int)) 0))) (= .cse2 (store .cse3 (@diff .cse3 .cse2) 0)))) (= .cse4 0) (= .cse5 .cse3)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (or (and (or (< mkdup_~i~0 mkdup_~j~0) .cse1) (< 0 mkdup_~i~0)) .cse0) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (<= 3 |mkdup_#in~n|) (= (select .cse3 (+ |mkdup_#in~a.offset| 4)) (select .cse3 |mkdup_#in~a.offset|))) (let ((.cse6 (store .cse5 .cse9 .cse4))) (or (= .cse6 .cse3) (let ((.cse8 (@diff .cse6 .cse3))) (let ((.cse7 (select .cse3 .cse8))) (and (= .cse7 .cse4) (= (store (store .cse5 .cse8 .cse7) .cse9 .cse4) .cse3)))))))))) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (and (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (or (< 0 mkdup_~i~0) (= (* mkdup_~i~0 4) 0)) (or (= mkdup_~j~0 0) (< 0 mkdup_~j~0)) (= |#memory_int| |old(#memory_int)|) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (= mkdup_~a.base |mkdup_#in~a.base|)) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (and (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (or (= (* mkdup_~i~0 4) 0) (< 0 mkdup_~i~0)) (<= 0 mkdup_~j~0) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (= mkdup_~a.base |mkdup_#in~a.base|)) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (and (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: (and (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (= (* mkdup_~i~0 4) 0) (< 0 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|)) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point mkdupEXIT(lines 19 31) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse3 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse9 (@diff .cse5 .cse3))) (let ((.cse1 (= mkdup_~a.base |mkdup_#in~a.base|)) (.cse0 (= (* mkdup_~i~0 4) 0)) (.cse4 (select .cse3 .cse9))) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= |mkdup_#in~n| mkdup_~n) (or (not .cse0) .cse1) (or (= mkdup_~j~0 0) (< 0 mkdup_~j~0)) (or (not (let ((.cse2 ((as const (Array Int Int)) 0))) (= .cse2 (store .cse3 (@diff .cse3 .cse2) 0)))) (= .cse4 0) (= .cse5 .cse3)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (or (and (or (< mkdup_~i~0 mkdup_~j~0) .cse1) (< 0 mkdup_~i~0)) .cse0) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (<= 3 |mkdup_#in~n|) (= (select .cse3 (+ |mkdup_#in~a.offset| 4)) (select .cse3 |mkdup_#in~a.offset|))) (let ((.cse6 (store .cse5 .cse9 .cse4))) (or (= .cse6 .cse3) (let ((.cse8 (@diff .cse6 .cse3))) (let ((.cse7 (select .cse3 .cse8))) (and (= .cse7 .cse4) (= (store (store .cse5 .cse8 .cse7) .cse9 .cse4) .cse3)))))))))) [2021-04-16 07:59:49,378 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,378 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,378 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,378 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L16(line 16) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point L16-2(lines 15 17) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-04-16 07:59:49,378 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2021-04-16 07:59:49,378 INFO L194 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-04-16 07:59:49,379 INFO L194 CegarLoopUtils]: At program point L62(line 62) the Hoare annotation is: (let ((.cse11 (select |#memory_int| main_~a~0.base)) (.cse10 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse1 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse3 (= main_~a~0.offset 0)) (.cse4 (<= 2 main_~n~0)) (.cse0 (not (= |main_#t~mem25| |main_#t~mem24|))) (.cse2 (= |main_#t~malloc16.offset| 0)) (.cse5 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse6 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse12 (select .cse11 (* .cse10 4))) (.cse8 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse9 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse7 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 (<= 1 .cse10) (= (select .cse11 0) .cse12)) (let ((.cse17 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse11 .cse17))) (let ((.cse15 (store .cse11 .cse13 0))) (let ((.cse14 (* .cse7 4)) (.cse16 (@diff .cse15 .cse17))) (and .cse1 .cse3 (<= (+ .cse7 1) .cse10) (or (= (select .cse11 .cse13) .cse12) (not (= .cse13 .cse14))) .cse4 (or (not (= (select .cse11 .cse14) 0)) (= .cse12 0)) .cse0 (= (store .cse15 .cse16 0) .cse17) .cse2 .cse5 .cse6 (or (not (= .cse16 .cse14)) (= (select .cse11 .cse16) .cse12)) .cse8 .cse9)))))))) [2021-04-16 07:59:49,379 INFO L194 CegarLoopUtils]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse4 (select |#memory_int| main_~a~0.base)) (.cse3 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse9 (not (= |main_#t~mem25| |main_#t~mem24|))) (.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse13 (= |main_#t~malloc16.offset| 0)) (.cse1 (= main_~a~0.offset 0)) (.cse8 (<= 2 main_~n~0)) (.cse14 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse15 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse17 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse16 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse6 (select .cse4 (* .cse3 4)))) (or (let ((.cse12 ((as const (Array Int Int)) 0))) (let ((.cse5 (@diff .cse4 .cse12))) (let ((.cse10 (store .cse4 .cse5 0))) (let ((.cse7 (* .cse2 4)) (.cse11 (@diff .cse10 .cse12))) (and .cse0 .cse1 (<= (+ .cse2 1) .cse3) (or (= (select .cse4 .cse5) .cse6) (not (= .cse5 .cse7))) .cse8 (or (not (= (select .cse4 .cse7) 0)) (= .cse6 0)) .cse9 (= (store .cse10 .cse11 0) .cse12) .cse13 .cse14 .cse15 (or (not (= .cse11 .cse7)) (= (select .cse4 .cse11) .cse6)) .cse16 .cse17))))) (and .cse9 .cse0 .cse13 .cse1 .cse8 .cse14 .cse15 (= .cse2 0) .cse17 .cse16 (= (select .cse4 0) .cse6))))) [2021-04-16 07:59:49,379 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse6 (select |#memory_int| main_~a~0.base)) (.cse15 (= .cse4 0)) (.cse5 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse3 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse10 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse11 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse12 (let ((.cse16 (= |main_#t~malloc16.offset| 0)) (.cse17 (= main_~a~0.offset 0)) (.cse18 (<= (+ .cse5 1) main_~n~0)) (.cse19 (<= 1 .cse5))) (or (and (<= 1 .cse4) .cse16 .cse17 .cse18 |main_#t~short20| .cse19 (<= (+ .cse4 2) main_~n~0)) (and .cse16 .cse17 .cse15 |main_#t~short20| .cse18 .cse19)))) (.cse13 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse14 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse8 (select .cse6 (* .cse5 4)))) (or (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse7 (@diff .cse6 .cse2))) (let ((.cse0 (store .cse6 .cse7 0))) (let ((.cse1 (@diff .cse0 .cse2)) (.cse9 (* .cse4 4))) (and (= (store .cse0 .cse1 0) .cse2) .cse3 (<= (+ .cse4 1) .cse5) (or (= (select .cse6 .cse7) .cse8) (not (= .cse7 .cse9))) .cse10 .cse11 (or (not (= .cse1 .cse9)) (= (select .cse6 .cse1) .cse8)) .cse12 (or (not (= (select .cse6 .cse9) 0)) (= .cse8 0)) .cse13 .cse14))))) (and .cse3 .cse10 .cse11 .cse15 .cse12 .cse13 .cse14 (= (select .cse6 0) .cse8)))))) [2021-04-16 07:59:49,379 INFO L194 CegarLoopUtils]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse4 (select |#memory_int| main_~a~0.base)) (.cse3 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= main_~a~0.offset 0)) (.cse12 (= |main_#t~malloc16.offset| 0)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse13 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse14 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse17 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse15 (<= (+ .cse3 1) main_~n~0)) (.cse16 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse8 (<= 1 .cse3)) (.cse6 (select .cse4 (* .cse3 4)))) (or (let ((.cse11 ((as const (Array Int Int)) 0))) (let ((.cse5 (@diff .cse4 .cse11))) (let ((.cse9 (store .cse4 .cse5 0))) (let ((.cse7 (* .cse2 4)) (.cse10 (@diff .cse9 .cse11))) (and .cse0 .cse1 (<= (+ .cse2 1) .cse3) (or (= (select .cse4 .cse5) .cse6) (not (= .cse5 .cse7))) (or (not (= (select .cse4 .cse7) 0)) (= .cse6 0)) .cse8 (= (store .cse9 .cse10 0) .cse11) .cse12 .cse13 .cse14 (or (not (= .cse10 .cse7)) (= (select .cse4 .cse10) .cse6)) .cse15 |main_#t~short20| .cse16 .cse17))))) (and .cse0 .cse1 .cse12 (= .cse2 0) .cse13 .cse14 .cse17 .cse15 |main_#t~short20| .cse16 .cse8 (= (select .cse4 0) .cse6))))) [2021-04-16 07:59:49,380 INFO L194 CegarLoopUtils]: At program point L60-3(line 60) the Hoare annotation is: (let ((.cse11 (select |#memory_int| main_~a~0.base)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse13 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= main_~a~0.offset 0)) (.cse3 (<= 1 .cse13)) (.cse4 (<= (+ .cse2 2) main_~n~0)) (.cse5 (= |main_#t~malloc16.offset| 0)) (.cse6 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse7 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse12 (select .cse11 (* .cse13 4))) (.cse8 (<= (+ .cse13 1) main_~n~0)) (.cse9 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse10 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 (= .cse2 0) .cse3 .cse4 .cse5 .cse6 .cse7 |main_#t~short20| .cse8 .cse9 .cse10 (= (select .cse11 0) .cse12)) (let ((.cse18 ((as const (Array Int Int)) 0))) (let ((.cse14 (@diff .cse11 .cse18))) (let ((.cse16 (store .cse11 .cse14 0))) (let ((.cse15 (* .cse2 4)) (.cse17 (@diff .cse16 .cse18))) (and .cse0 .cse1 (<= (+ .cse2 1) .cse13) (or (= (select .cse11 .cse14) .cse12) (not (= .cse14 .cse15))) (or (not (= (select .cse11 .cse15) 0)) (= .cse12 0)) .cse3 .cse4 (= (store .cse16 .cse17 0) .cse18) .cse5 .cse6 .cse7 (or (not (= .cse17 .cse15)) (= (select .cse11 .cse17) .cse12)) |main_#t~short20| .cse8 .cse9 .cse10)))))))) [2021-04-16 07:59:49,380 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 48 66) the Hoare annotation is: true [2021-04-16 07:59:49,380 INFO L194 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (= .cse0 (select |#memory_int| |main_#t~malloc16.base|)) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|))) [2021-04-16 07:59:49,380 INFO L194 CegarLoopUtils]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse3 (select |#memory_int| main_~a~0.base)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2))) (let ((.cse0 (store .cse3 .cse4 0))) (let ((.cse1 (@diff .cse0 .cse2))) (and (= (store .cse0 .cse1 0) .cse2) (or (= (select .cse3 .cse4) (select .cse3 .cse1)) (= .cse0 .cse2)) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (or (let ((.cse5 (* main_~n~0 4))) (= (select .cse3 (+ .cse5 (- 4))) (select .cse3 (+ .cse5 (- 8))))) (< 8 (* 4 main_~n~0)))))))) [2021-04-16 07:59:49,380 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc16.offset| 0) (= |#memory_int| |old(#memory_int)|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) [2021-04-16 07:59:49,380 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (= |main_#t~malloc16.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) [2021-04-16 07:59:49,380 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 48 66) the Hoare annotation is: true [2021-04-16 07:59:49,381 INFO L194 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (let ((.cse10 (select |#memory_int| main_~a~0.base)) (.cse12 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse1 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse3 (= main_~a~0.offset 0)) (.cse4 (<= 2 main_~n~0)) (.cse0 (= |main_#t~mem29| |main_#t~mem28|)) (.cse2 (= |main_#t~malloc16.offset| 0)) (.cse5 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse6 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse11 (select .cse10 (* .cse12 4))) (.cse8 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse9 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse7 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 (= (select .cse10 0) .cse11)) (let ((.cse17 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse10 .cse17))) (let ((.cse15 (store .cse10 .cse13 0))) (let ((.cse14 (* .cse7 4)) (.cse16 (@diff .cse15 .cse17))) (and .cse1 .cse3 (<= (+ .cse7 1) .cse12) (or (= (select .cse10 .cse13) .cse11) (not (= .cse13 .cse14))) .cse4 (or (not (= (select .cse10 .cse14) 0)) (= .cse11 0)) .cse0 (= (store .cse15 .cse16 0) .cse17) .cse2 .cse5 .cse6 (or (not (= .cse16 .cse14)) (= (select .cse10 .cse16) .cse11)) .cse8 .cse9)))))))) [2021-04-16 07:59:49,381 INFO L201 CegarLoopUtils]: At program point L63-1(line 63) the Hoare annotation is: true [2021-04-16 07:59:49,381 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-04-16 07:59:49,381 INFO L194 CegarLoopUtils]: At program point L61(line 61) the Hoare annotation is: (let ((.cse10 (select |#memory_int| main_~a~0.base)) (.cse12 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= main_~a~0.offset 0)) (.cse9 (<= 1 .cse12)) (.cse2 (= |main_#t~malloc16.offset| 0)) (.cse4 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse5 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse11 (select .cse10 (* .cse12 4))) (.cse6 (<= (+ .cse12 1) main_~n~0)) (.cse7 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse8 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (or (and .cse0 .cse1 .cse2 (= .cse3 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 |main_#t~short23| (= (select .cse10 0) .cse11)) (let ((.cse17 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse10 .cse17))) (let ((.cse15 (store .cse10 .cse13 0))) (let ((.cse14 (* .cse3 4)) (.cse16 (@diff .cse15 .cse17))) (and .cse0 .cse1 (<= (+ .cse3 1) .cse12) (or (= (select .cse10 .cse13) .cse11) (not (= .cse13 .cse14))) (or (not (= (select .cse10 .cse14) 0)) (= .cse11 0)) .cse9 (= (store .cse15 .cse16 0) .cse17) .cse2 .cse4 .cse5 (or (not (= .cse16 .cse14)) (= (select .cse10 .cse16) .cse11)) .cse6 .cse7 .cse8 |main_#t~short23|)))))))) [2021-04-16 07:59:49,381 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (let ((.cse13 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse8 (select |#memory_int| main_~a~0.base)) (.cse4 (= .cse13 0)) (.cse14 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= |main_#t~malloc16.offset| 0)) (.cse2 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse3 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse5 (let ((.cse17 (= main_~r~0 1)) (.cse18 (= main_~a~0.offset 0)) (.cse19 (<= (+ .cse14 1) main_~n~0)) (.cse20 (<= 1 .cse14))) (or (and .cse17 (<= 1 .cse13) .cse18 .cse19 .cse20 (<= (+ .cse13 2) main_~n~0)) (and .cse17 .cse18 .cse4 .cse19 .cse20)))) (.cse9 (select .cse8 (* .cse14 4))) (.cse6 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse7 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse8 0) .cse9)) (let ((.cse12 ((as const (Array Int Int)) 0))) (let ((.cse15 (@diff .cse8 .cse12))) (let ((.cse10 (store .cse8 .cse15 0))) (let ((.cse11 (@diff .cse10 .cse12)) (.cse16 (* .cse13 4))) (and (= (store .cse10 .cse11 0) .cse12) .cse0 .cse1 (<= (+ .cse13 1) .cse14) (or (= (select .cse8 .cse15) .cse9) (not (= .cse15 .cse16))) .cse2 .cse3 (or (not (= .cse11 .cse16)) (= (select .cse8 .cse11) .cse9)) .cse5 (or (not (= (select .cse8 .cse16) 0)) (= .cse9 0)) .cse6 .cse7))))))))) [2021-04-16 07:59:49,381 INFO L194 CegarLoopUtils]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse12 (select |#memory_int| main_~a~0.base)) (.cse4 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= main_~a~0.offset 0)) (.cse2 (<= 2 main_~n~0)) (.cse5 (<= (+ .cse3 2) main_~n~0)) (.cse6 (= |main_#t~malloc16.offset| 0)) (.cse7 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse8 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse13 (select .cse12 (* .cse4 4))) (.cse9 (<= (+ .cse4 1) main_~n~0)) (.cse10 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse11 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 (= .cse3 0) (<= 1 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 |main_#t~short23| (= (select .cse12 0) .cse13)) (let ((.cse18 ((as const (Array Int Int)) 0))) (let ((.cse14 (@diff .cse12 .cse18))) (let ((.cse16 (store .cse12 .cse14 0))) (let ((.cse15 (* .cse3 4)) (.cse17 (@diff .cse16 .cse18))) (and .cse0 .cse1 (<= (+ .cse3 1) .cse4) .cse2 (or (= (select .cse12 .cse14) .cse13) (not (= .cse14 .cse15))) (or (not (= (select .cse12 .cse15) 0)) (= .cse13 0)) .cse5 (= (store .cse16 .cse17 0) .cse18) .cse6 .cse7 .cse8 (or (not (= .cse17 .cse15)) (= (select .cse12 .cse17) .cse13)) .cse9 .cse10 .cse11 |main_#t~short23|)))))))) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse13 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse4 (= .cse13 0)) (.cse8 (select |#memory_int| main_~a~0.base)) (.cse14 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= |main_#t~malloc16.offset| 0)) (.cse2 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse3 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse9 (select .cse8 (* .cse14 4))) (.cse5 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse6 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse7 (let ((.cse17 (= main_~a~0.offset 0)) (.cse18 (<= (+ .cse14 1) main_~n~0)) (.cse19 (<= 1 .cse14))) (or (and .cse17 .cse4 .cse18 .cse19) (and (<= 1 .cse13) .cse17 .cse18 .cse19 (<= (+ .cse13 2) main_~n~0)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse8 0) .cse9)) (let ((.cse12 ((as const (Array Int Int)) 0))) (let ((.cse15 (@diff .cse8 .cse12))) (let ((.cse10 (store .cse8 .cse15 0))) (let ((.cse11 (@diff .cse10 .cse12)) (.cse16 (* .cse13 4))) (and (= (store .cse10 .cse11 0) .cse12) .cse0 .cse1 (<= (+ .cse13 1) .cse14) (or (= (select .cse8 .cse15) .cse9) (not (= .cse15 .cse16))) .cse2 .cse3 (or (not (= .cse11 .cse16)) (= (select .cse8 .cse11) .cse9)) (or (not (= (select .cse8 .cse16) 0)) (= .cse9 0)) .cse5 .cse6 .cse7))))))))) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L61-3(line 61) the Hoare annotation is: (let ((.cse10 (select |#memory_int| main_~a~0.base)) (.cse9 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse2 (= main_~a~0.offset 0)) (.cse3 (<= 2 main_~n~0)) (.cse1 (= |main_#t~malloc16.offset| 0)) (.cse4 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse5 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse11 (select .cse10 (* .cse9 4))) (.cse7 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse8 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse6 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 0) .cse7 .cse8 (<= 1 .cse9) (= (select .cse10 0) .cse11)) (let ((.cse16 ((as const (Array Int Int)) 0))) (let ((.cse12 (@diff .cse10 .cse16))) (let ((.cse14 (store .cse10 .cse12 0))) (let ((.cse13 (* .cse6 4)) (.cse15 (@diff .cse14 .cse16))) (and .cse0 .cse2 (<= (+ .cse6 1) .cse9) (or (= (select .cse10 .cse12) .cse11) (not (= .cse12 .cse13))) .cse3 (or (not (= (select .cse10 .cse13) 0)) (= .cse11 0)) (= (store .cse14 .cse15 0) .cse16) .cse1 .cse4 .cse5 (or (not (= .cse15 .cse13)) (= (select .cse10 .cse15) .cse11)) .cse7 .cse8)))))))) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (let ((.cse3 (select |#memory_int| main_~a~0.base)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2))) (let ((.cse0 (store .cse3 .cse4 0))) (let ((.cse1 (@diff .cse0 .cse2))) (and (= (store .cse0 .cse1 0) .cse2) (not (= |main_~#i~2.base| main_~a~0.base)) (or (= (select .cse3 .cse4) (select .cse3 .cse1)) (= .cse0 .cse2)) (= main_~a~0.offset 0) (= |main_#t~malloc16.offset| 0) (<= 2 main_~n~0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)) (or (let ((.cse5 (* main_~n~0 4))) (= (select .cse3 (+ .cse5 (- 4))) (select .cse3 (+ .cse5 (- 8))))) (< 8 (* 4 main_~n~0)))))))) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse11 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse6 (select |#memory_int| main_~a~0.base)) (.cse4 (= .cse11 0)) (.cse12 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (let ((.cse15 (= |main_#t~ret17| 1)) (.cse16 (= |main_#t~malloc16.offset| 0)) (.cse17 (= main_~a~0.offset 0)) (.cse18 (<= (+ .cse12 1) main_~n~0)) (.cse19 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse20 (<= 1 .cse12))) (or (and .cse15 .cse16 .cse17 .cse4 .cse18 .cse19 .cse20) (and .cse15 (<= 1 .cse11) .cse16 .cse17 .cse18 .cse19 .cse20 (<= (+ .cse11 2) main_~n~0))))) (.cse1 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse2 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse3 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse7 (select .cse6 (* .cse12 4))) (.cse5 (not (= main_~a~0.base |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse6 0) .cse7)) (let ((.cse10 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse6 .cse10))) (let ((.cse8 (store .cse6 .cse13 0))) (let ((.cse9 (@diff .cse8 .cse10)) (.cse14 (* .cse11 4))) (and (= (store .cse8 .cse9 0) .cse10) .cse0 .cse1 (<= (+ .cse11 1) .cse12) (or (= (select .cse6 .cse13) .cse7) (not (= .cse13 .cse14))) .cse2 .cse3 (or (not (= .cse9 .cse14)) (= (select .cse6 .cse9) .cse7)) (or (not (= (select .cse6 .cse14) 0)) (= .cse7 0)) .cse5))))))))) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L51(line 51) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-04-16 07:59:49,382 INFO L194 CegarLoopUtils]: At program point L51-1(line 51) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-04-16 07:59:49,382 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point L10(line 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point L10-3(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-04-16 07:59:49,383 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-04-16 07:59:49,395 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:559) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-04-16 07:59:49,396 INFO L168 Benchmark]: Toolchain (without parser) took 44483.01 ms. Allocated memory was 205.5 MB in the beginning and 549.5 MB in the end (delta: 343.9 MB). Free memory was 171.9 MB in the beginning and 357.3 MB in the end (delta: -185.4 MB). Peak memory consumption was 316.5 MB. Max. memory is 8.0 GB. [2021-04-16 07:59:49,396 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 205.5 MB. Free memory is still 188.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-04-16 07:59:49,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.61 ms. Allocated memory is still 205.5 MB. Free memory was 171.6 MB in the beginning and 187.9 MB in the end (delta: -16.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 8.0 GB. [2021-04-16 07:59:49,397 INFO L168 Benchmark]: Boogie Preprocessor took 46.06 ms. Allocated memory is still 205.5 MB. Free memory was 187.9 MB in the beginning and 186.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-04-16 07:59:49,397 INFO L168 Benchmark]: RCFGBuilder took 440.01 ms. Allocated memory is still 205.5 MB. Free memory was 186.0 MB in the beginning and 162.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-04-16 07:59:49,397 INFO L168 Benchmark]: TraceAbstraction took 43683.11 ms. Allocated memory was 205.5 MB in the beginning and 549.5 MB in the end (delta: 343.9 MB). Free memory was 162.3 MB in the beginning and 357.3 MB in the end (delta: -195.0 MB). Peak memory consumption was 307.0 MB. Max. memory is 8.0 GB. [2021-04-16 07:59:49,397 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.18 ms. Allocated memory is still 205.5 MB. Free memory is still 188.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 290.61 ms. Allocated memory is still 205.5 MB. Free memory was 171.6 MB in the beginning and 187.9 MB in the end (delta: -16.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.06 ms. Allocated memory is still 205.5 MB. Free memory was 187.9 MB in the beginning and 186.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 440.01 ms. Allocated memory is still 205.5 MB. Free memory was 186.0 MB in the beginning and 162.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 43683.11 ms. Allocated memory was 205.5 MB in the beginning and 549.5 MB in the end (delta: 343.9 MB). Free memory was 162.3 MB in the beginning and 357.3 MB in the end (delta: -195.0 MB). Peak memory consumption was 307.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 30539.6ms, OverallIterations: 17, TraceHistogramMax: 5, EmptinessCheckTime: 29.5ms, AutomataDifference: 21265.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 13083.6ms, InitialAbstractionConstructionTime: 8.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 790 SDtfs, 1381 SDslu, 2733 SDs, 0 SdLazy, 9341 SolverSat, 1196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6903.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 18263.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=13, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 295.8ms AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 59 LocationsWithAnnotation, 468 PreInvPairs, 652 NumberOfFragments, 10044 HoareAnnotationTreeSize, 468 FomulaSimplifications, 234878 FormulaSimplificationTreeSizeReduction, 1038.4ms HoareSimplificationTime, 59 FomulaSimplificationsInter, 26645 FormulaSimplificationTreeSizeReductionInter, 12010.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...