/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-fpi/condg.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:09:50,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:09:50,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:09:50,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:09:50,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:09:50,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:09:50,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:09:50,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:09:50,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:09:50,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:09:50,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:09:50,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:09:50,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:09:50,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:09:50,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:09:50,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:09:50,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:09:50,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:09:50,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:09:50,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:09:50,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:09:50,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:09:50,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:09:50,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:09:50,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:09:50,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:09:50,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:09:50,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:09:50,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:09:50,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:09:50,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:09:50,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:09:50,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:09:51,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:09:51,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:09:51,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:09:51,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:09:51,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:09:51,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:09:51,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:09:51,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:09:51,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:09:51,062 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:09:51,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:09:51,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:09:51,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:09:51,065 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:09:51,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:09:51,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:09:51,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:09:51,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:09:51,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:09:51,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:09:51,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:09:51,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:09:51,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:09:51,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:09:51,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:09:51,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:09:51,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:09:51,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:09:51,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:09:51,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:09:51,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:09:51,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:09:51,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:09:51,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:09:51,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/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-01-06 11:09:51,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:09:51,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:09:51,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:09:51,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:09:51,483 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:09:51,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2021-01-06 11:09:51,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8be4d0448/475aba2c75e34cd5ac6508fb7c5fc916/FLAGf3fa8efba [2021-01-06 11:09:52,270 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:09:52,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2021-01-06 11:09:52,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8be4d0448/475aba2c75e34cd5ac6508fb7c5fc916/FLAGf3fa8efba [2021-01-06 11:09:52,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8be4d0448/475aba2c75e34cd5ac6508fb7c5fc916 [2021-01-06 11:09:52,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:09:52,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:09:52,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:09:52,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:09:52,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:09:52,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:52,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5009073d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52, skipping insertion in model container [2021-01-06 11:09:52,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:52,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:09:52,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 11:09:52,897 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sum~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sum~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 11:09:52,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:09:52,932 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 11:09:52,946 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sum~0,],base],StructAccessExpression[IdentifierExpression[~#sum~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sum~0,],base],StructAccessExpression[IdentifierExpression[~#sum~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 11:09:52,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:09:52,975 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:09:52,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52 WrapperNode [2021-01-06 11:09:52,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:09:52,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:09:52,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:09:52,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:09:52,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:52,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:09:53,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:09:53,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:09:53,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:09:53,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... [2021-01-06 11:09:53,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:09:53,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:09:53,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:09:53,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:09:53,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-01-06 11:09:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:09:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:09:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:09:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:09:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:09:53,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:09:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:09:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 11:09:53,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:09:53,753 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-01-06 11:09:53,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:09:53 BoogieIcfgContainer [2021-01-06 11:09:53,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:09:53,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:09:53,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:09:53,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:09:53,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:09:52" (1/3) ... [2021-01-06 11:09:53,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60546a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:09:53, skipping insertion in model container [2021-01-06 11:09:53,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:09:52" (2/3) ... [2021-01-06 11:09:53,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60546a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:09:53, skipping insertion in model container [2021-01-06 11:09:53,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:09:53" (3/3) ... [2021-01-06 11:09:53,815 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2021-01-06 11:09:53,831 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:09:53,862 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:09:53,895 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:09:53,925 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:09:53,925 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:09:53,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:09:53,926 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:09:53,926 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:09:53,926 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:09:53,926 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:09:53,926 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:09:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2021-01-06 11:09:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 11:09:53,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:53,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:09:53,952 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:09:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:09:53,959 INFO L82 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2021-01-06 11:09:53,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:09:53,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601697384] [2021-01-06 11:09:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:09:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:09:54,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601697384] [2021-01-06 11:09:54,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:09:54,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:09:54,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589535179] [2021-01-06 11:09:54,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 11:09:54,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:09:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 11:09:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:09:54,170 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2021-01-06 11:09:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:09:54,192 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2021-01-06 11:09:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 11:09:54,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2021-01-06 11:09:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:09:54,205 INFO L225 Difference]: With dead ends: 46 [2021-01-06 11:09:54,205 INFO L226 Difference]: Without dead ends: 21 [2021-01-06 11:09:54,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:09:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-01-06 11:09:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-01-06 11:09:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 11:09:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-01-06 11:09:54,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-01-06 11:09:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:09:54,249 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-01-06 11:09:54,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 11:09:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-01-06 11:09:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 11:09:54,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:54,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:09:54,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:09:54,251 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:09:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:09:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2021-01-06 11:09:54,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:09:54,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455643603] [2021-01-06 11:09:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:09:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:09:54,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455643603] [2021-01-06 11:09:54,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:09:54,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:09:54,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28233457] [2021-01-06 11:09:54,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:09:54,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:09:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:09:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:09:54,358 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2021-01-06 11:09:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:09:54,480 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-01-06 11:09:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:09:54,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-01-06 11:09:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:09:54,482 INFO L225 Difference]: With dead ends: 48 [2021-01-06 11:09:54,482 INFO L226 Difference]: Without dead ends: 34 [2021-01-06 11:09:54,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:09:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-01-06 11:09:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2021-01-06 11:09:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 11:09:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-01-06 11:09:54,491 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2021-01-06 11:09:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:09:54,491 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-01-06 11:09:54,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:09:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-01-06 11:09:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:09:54,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:54,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:09:54,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:09:54,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:09:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:09:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2021-01-06 11:09:54,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:09:54,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116439443] [2021-01-06 11:09:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:09:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:09:54,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116439443] [2021-01-06 11:09:54,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095277280] [2021-01-06 11:09:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:09:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:55,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-06 11:09:55,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:09:55,262 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-01-06 11:09:55,273 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:55,287 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-01-06 11:09:55,344 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 11:09:55,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:55,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-06 11:09:55,564 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:55,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 43 [2021-01-06 11:09:55,570 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,591 INFO L625 ElimStorePlain]: treesize reduction 22, result has 35.3 percent of original size [2021-01-06 11:09:55,594 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2021-01-06 11:09:55,694 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-06 11:09:55,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:55,701 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:09:55,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2021-01-06 11:09:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:09:55,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:09:55,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2021-01-06 11:09:55,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297385812] [2021-01-06 11:09:55,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 11:09:55,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:09:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 11:09:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-01-06 11:09:55,830 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2021-01-06 11:09:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:09:56,773 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-01-06 11:09:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:09:56,773 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2021-01-06 11:09:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:09:56,776 INFO L225 Difference]: With dead ends: 52 [2021-01-06 11:09:56,776 INFO L226 Difference]: Without dead ends: 50 [2021-01-06 11:09:56,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2021-01-06 11:09:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-06 11:09:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 30. [2021-01-06 11:09:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 11:09:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-01-06 11:09:56,786 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2021-01-06 11:09:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:09:56,787 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-01-06 11:09:56,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 11:09:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-01-06 11:09:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:09:56,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:56,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:09:57,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 11:09:57,003 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:09:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:09:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2021-01-06 11:09:57,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:09:57,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545309642] [2021-01-06 11:09:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:09:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:09:57,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545309642] [2021-01-06 11:09:57,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411012712] [2021-01-06 11:09:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:09:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:57,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 11:09:57,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:09:57,697 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 11:09:57,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:57,707 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 11:09:57,708 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:57,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:57,732 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:09:57,732 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2021-01-06 11:09:57,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:09:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:09:57,801 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:09:57,803 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:57,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:09:57,814 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:09:57,817 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:57,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:57,847 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:09:57,848 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:61 [2021-01-06 11:09:57,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-06 11:09:57,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:09:57,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:09:58,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:09:58,090 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-01-06 11:09:58,092 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:58,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:58,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:09:58,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:27 [2021-01-06 11:09:58,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:09:58,212 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-06 11:09:58,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:09:58,221 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:09:58,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:09:58,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:7 [2021-01-06 11:09:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:09:58,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:09:58,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-01-06 11:09:58,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147436240] [2021-01-06 11:09:58,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 11:09:58,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:09:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 11:09:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-01-06 11:09:58,262 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 19 states. [2021-01-06 11:09:58,422 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2021-01-06 11:09:58,574 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2021-01-06 11:09:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:09:59,139 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2021-01-06 11:09:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:09:59,140 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2021-01-06 11:09:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:09:59,141 INFO L225 Difference]: With dead ends: 50 [2021-01-06 11:09:59,141 INFO L226 Difference]: Without dead ends: 40 [2021-01-06 11:09:59,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2021-01-06 11:09:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-01-06 11:09:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-01-06 11:09:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 11:09:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-01-06 11:09:59,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 21 [2021-01-06 11:09:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:09:59,152 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-01-06 11:09:59,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 11:09:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-01-06 11:09:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:09:59,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:59,153 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:09:59,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:09:59,367 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:09:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:09:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2021-01-06 11:09:59,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:09:59,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197014197] [2021-01-06 11:09:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:09:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:09:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:09:59,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197014197] [2021-01-06 11:09:59,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010638846] [2021-01-06 11:09:59,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:09:59,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 11:09:59,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:09:59,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 11:09:59,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:09:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:09:59,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:09:59,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-06 11:09:59,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396613554] [2021-01-06 11:09:59,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 11:09:59,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:09:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 11:09:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:09:59,677 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2021-01-06 11:09:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:09:59,959 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2021-01-06 11:09:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:09:59,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2021-01-06 11:09:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:09:59,960 INFO L225 Difference]: With dead ends: 84 [2021-01-06 11:09:59,960 INFO L226 Difference]: Without dead ends: 49 [2021-01-06 11:09:59,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-01-06 11:09:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-01-06 11:09:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2021-01-06 11:09:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-01-06 11:09:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-01-06 11:09:59,969 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2021-01-06 11:09:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:09:59,969 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-01-06 11:09:59,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 11:09:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-01-06 11:09:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:09:59,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:09:59,971 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:00,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:00,184 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 943879772, now seen corresponding path program 2 times [2021-01-06 11:10:00,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:00,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622699416] [2021-01-06 11:10:00,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 11:10:00,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622699416] [2021-01-06 11:10:00,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193481813] [2021-01-06 11:10:00,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:00,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 11:10:00,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:10:00,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-06 11:10:00,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:00,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 11:10:00,735 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:00,743 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-01-06 11:10:00,822 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:00,823 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2021-01-06 11:10:00,825 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,852 INFO L625 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-01-06 11:10:00,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-01-06 11:10:00,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:00,985 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-06 11:10:00,985 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2021-01-06 11:10:00,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:00,996 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:00,996 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2021-01-06 11:10:01,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:01,036 INFO L348 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2021-01-06 11:10:01,037 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 69 [2021-01-06 11:10:01,040 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,054 INFO L625 ElimStorePlain]: treesize reduction 42, result has 34.4 percent of original size [2021-01-06 11:10:01,056 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2021-01-06 11:10:01,178 INFO L348 Elim1Store]: treesize reduction 10, result has 91.0 percent of original size [2021-01-06 11:10:01,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 120 [2021-01-06 11:10:01,184 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,211 INFO L625 ElimStorePlain]: treesize reduction 90, result has 21.1 percent of original size [2021-01-06 11:10:01,213 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:24 [2021-01-06 11:10:01,364 INFO L348 Elim1Store]: treesize reduction 10, result has 91.0 percent of original size [2021-01-06 11:10:01,365 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 120 [2021-01-06 11:10:01,369 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,408 INFO L625 ElimStorePlain]: treesize reduction 72, result has 37.9 percent of original size [2021-01-06 11:10:01,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:01,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:01,414 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:01,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2021-01-06 11:10:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:10:01,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:01,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2021-01-06 11:10:01,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900331731] [2021-01-06 11:10:01,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 11:10:01,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:01,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 11:10:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2021-01-06 11:10:01,531 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 28 states. [2021-01-06 11:10:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:03,705 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2021-01-06 11:10:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 11:10:03,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2021-01-06 11:10:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:03,709 INFO L225 Difference]: With dead ends: 86 [2021-01-06 11:10:03,709 INFO L226 Difference]: Without dead ends: 84 [2021-01-06 11:10:03,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=430, Invalid=2650, Unknown=0, NotChecked=0, Total=3080 [2021-01-06 11:10:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-06 11:10:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 39. [2021-01-06 11:10:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 11:10:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-01-06 11:10:03,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 28 [2021-01-06 11:10:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:03,723 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-01-06 11:10:03,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 11:10:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2021-01-06 11:10:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:10:03,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:03,724 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:03,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:03,933 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2021-01-06 11:10:03,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:03,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968854422] [2021-01-06 11:10:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 11:10:04,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968854422] [2021-01-06 11:10:04,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430258873] [2021-01-06 11:10:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:04,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 11:10:04,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:04,109 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-01-06 11:10:04,112 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:04,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:04,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:04,126 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-06 11:10:04,176 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-01-06 11:10:04,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:04,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:04,184 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:04,187 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:4 [2021-01-06 11:10:04,256 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:04,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 74 [2021-01-06 11:10:04,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:04,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (|v_#memory_int_27| (Array Int (Array Int Int))) (ULTIMATE.start_main_~i~0 Int)) (let ((.cse0 (store |v_#memory_int_27| ULTIMATE.start_main_~a~0.base (let ((.cse2 (select |v_#memory_int_27| ULTIMATE.start_main_~a~0.base)) (.cse3 (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (select |v_#memory_int_27| |c_ULTIMATE.start_main_~#sum~0.base|))) (and (= |c_#memory_int| .cse0) (= .cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0.base|)) (not (= (select .cse1 |c_ULTIMATE.start_main_~#sum~0.offset|) c_~N~0))))) is different from true [2021-01-06 11:10:04,367 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:04,367 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 74 [2021-01-06 11:10:04,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:04,445 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:04,446 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 116 [2021-01-06 11:10:04,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:04,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:10:04,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:04,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:04,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:04,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2021-01-06 11:10:04,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:04,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2021-01-06 11:10:04,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726808455] [2021-01-06 11:10:04,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:10:04,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:04,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:10:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=40, Unknown=2, NotChecked=12, Total=72 [2021-01-06 11:10:04,565 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 9 states. [2021-01-06 11:10:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:06,895 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-01-06 11:10:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:10:06,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 11:10:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:06,897 INFO L225 Difference]: With dead ends: 76 [2021-01-06 11:10:06,897 INFO L226 Difference]: Without dead ends: 66 [2021-01-06 11:10:06,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=126, Unknown=6, NotChecked=24, Total=210 [2021-01-06 11:10:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-01-06 11:10:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2021-01-06 11:10:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 11:10:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-01-06 11:10:06,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 28 [2021-01-06 11:10:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:06,914 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-01-06 11:10:06,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:10:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-01-06 11:10:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:10:06,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:06,915 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:07,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 11:10:07,116 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2021-01-06 11:10:07,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:07,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224594981] [2021-01-06 11:10:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:07,575 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-01-06 11:10:07,763 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2021-01-06 11:10:08,355 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2021-01-06 11:10:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:10:08,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224594981] [2021-01-06 11:10:08,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316851655] [2021-01-06 11:10:08,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:08,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 11:10:08,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:10:08,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-06 11:10:08,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:08,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 11:10:08,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:08,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:08,952 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:08,953 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-01-06 11:10:09,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:09,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:10:09,017 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:09,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-01-06 11:10:09,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:09,201 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:09,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2021-01-06 11:10:09,204 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,253 INFO L625 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2021-01-06 11:10:09,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2021-01-06 11:10:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:09,614 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:09,615 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 88 [2021-01-06 11:10:09,619 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,672 INFO L625 ElimStorePlain]: treesize reduction 46, result has 52.1 percent of original size [2021-01-06 11:10:09,674 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:10:09,675 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:50 [2021-01-06 11:10:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:09,900 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:09,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 88 [2021-01-06 11:10:09,904 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:09,968 INFO L625 ElimStorePlain]: treesize reduction 84, result has 44.0 percent of original size [2021-01-06 11:10:09,975 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-06 11:10:09,976 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:66 [2021-01-06 11:10:14,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:14,610 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:14,610 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57 [2021-01-06 11:10:14,615 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:14,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:14,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:10:14,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:10:14,668 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:10:14,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:10:14,673 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:14,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:81, output treesize:77 [2021-01-06 11:10:14,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:10:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:10:14,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:14,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2021-01-06 11:10:14,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436925837] [2021-01-06 11:10:14,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-06 11:10:14,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-06 11:10:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2021-01-06 11:10:14,941 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 32 states. [2021-01-06 11:10:24,800 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2021-01-06 11:10:35,010 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-06 11:10:43,217 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-01-06 11:10:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:50,141 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2021-01-06 11:10:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 11:10:50,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2021-01-06 11:10:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:50,143 INFO L225 Difference]: With dead ends: 74 [2021-01-06 11:10:50,143 INFO L226 Difference]: Without dead ends: 62 [2021-01-06 11:10:50,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=224, Invalid=1933, Unknown=5, NotChecked=0, Total=2162 [2021-01-06 11:10:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-06 11:10:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-01-06 11:10:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-06 11:10:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-01-06 11:10:50,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2021-01-06 11:10:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:50,160 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-01-06 11:10:50,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-06 11:10:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2021-01-06 11:10:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:10:50,162 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:50,162 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:50,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:50,364 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2021-01-06 11:10:50,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:50,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212709725] [2021-01-06 11:10:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 11:10:50,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212709725] [2021-01-06 11:10:50,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965488145] [2021-01-06 11:10:50,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:50,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 11:10:50,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:10:50,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:10:50,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 11:10:50,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:50,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-01-06 11:10:50,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834596428] [2021-01-06 11:10:50,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:10:50,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:10:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:10:50,631 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 13 states. [2021-01-06 11:10:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:50,922 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2021-01-06 11:10:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:10:50,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 11:10:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:50,927 INFO L225 Difference]: With dead ends: 145 [2021-01-06 11:10:50,927 INFO L226 Difference]: Without dead ends: 112 [2021-01-06 11:10:50,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:10:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-06 11:10:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2021-01-06 11:10:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 11:10:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2021-01-06 11:10:50,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 30 [2021-01-06 11:10:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:50,950 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2021-01-06 11:10:50,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:10:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2021-01-06 11:10:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:10:50,952 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:50,952 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:51,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:51,159 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1432341606, now seen corresponding path program 5 times [2021-01-06 11:10:51,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:51,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013795491] [2021-01-06 11:10:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 11:10:51,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013795491] [2021-01-06 11:10:51,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708291254] [2021-01-06 11:10:51,255 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:51,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-06 11:10:51,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:10:51,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:10:51,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 11:10:51,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:51,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-01-06 11:10:51,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864278439] [2021-01-06 11:10:51,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:10:51,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:10:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:10:51,473 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 13 states. [2021-01-06 11:10:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:51,996 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-01-06 11:10:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 11:10:51,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 11:10:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:51,997 INFO L225 Difference]: With dead ends: 119 [2021-01-06 11:10:51,998 INFO L226 Difference]: Without dead ends: 94 [2021-01-06 11:10:51,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-01-06 11:10:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-06 11:10:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2021-01-06 11:10:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-06 11:10:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-01-06 11:10:52,012 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 30 [2021-01-06 11:10:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:52,012 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-01-06 11:10:52,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:10:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2021-01-06 11:10:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:10:52,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:52,014 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:52,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 11:10:52,227 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2021-01-06 11:10:52,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:52,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467848724] [2021-01-06 11:10:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:53,256 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-01-06 11:10:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:10:54,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467848724] [2021-01-06 11:10:54,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031892502] [2021-01-06 11:10:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:54,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 11:10:54,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:54,699 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-01-06 11:10:54,706 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:54,713 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,713 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-06 11:10:54,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:10:54,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:54,827 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-01-06 11:10:54,911 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:54,912 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 47 [2021-01-06 11:10:54,914 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,925 INFO L625 ElimStorePlain]: treesize reduction 18, result has 43.8 percent of original size [2021-01-06 11:10:54,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:14 [2021-01-06 11:10:54,945 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:54,945 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 47 [2021-01-06 11:10:54,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,960 INFO L625 ElimStorePlain]: treesize reduction 24, result has 36.8 percent of original size [2021-01-06 11:10:54,964 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:54,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2021-01-06 11:10:55,099 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:55,100 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 72 [2021-01-06 11:10:55,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:55,124 INFO L625 ElimStorePlain]: treesize reduction 48, result has 21.3 percent of original size [2021-01-06 11:10:55,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:55,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2021-01-06 11:10:55,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-01-06 11:10:55,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:55,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:55,197 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:55,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:11 [2021-01-06 11:10:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:10:55,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:55,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2021-01-06 11:10:55,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750029762] [2021-01-06 11:10:55,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-06 11:10:55,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:55,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-06 11:10:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 11:10:55,428 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 34 states. [2021-01-06 11:10:55,898 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2021-01-06 11:10:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:58,022 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-01-06 11:10:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 11:10:58,023 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2021-01-06 11:10:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:58,024 INFO L225 Difference]: With dead ends: 81 [2021-01-06 11:10:58,024 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 11:10:58,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=393, Invalid=3147, Unknown=0, NotChecked=0, Total=3540 [2021-01-06 11:10:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 11:10:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2021-01-06 11:10:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-06 11:10:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2021-01-06 11:10:58,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2021-01-06 11:10:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:58,038 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2021-01-06 11:10:58,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-06 11:10:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2021-01-06 11:10:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:10:58,039 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:58,039 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:58,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:58,253 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2021-01-06 11:10:58,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:58,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79253994] [2021-01-06 11:10:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 11:10:58,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79253994] [2021-01-06 11:10:58,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229210526] [2021-01-06 11:10:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:58,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 11:10:58,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:58,395 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-01-06 11:10:58,397 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:58,403 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-06 11:10:58,432 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-01-06 11:10:58,434 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:58,437 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:4 [2021-01-06 11:10:58,451 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2021-01-06 11:10:58,453 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:58,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,460 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2021-01-06 11:10:58,466 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 11:10:58,468 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:58,470 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:58,471 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-06 11:10:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:10:58,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:10:58,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2021-01-06 11:10:58,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115505499] [2021-01-06 11:10:58,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:10:58,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:10:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:10:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:10:58,480 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 7 states. [2021-01-06 11:10:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:10:58,672 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-01-06 11:10:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:10:58,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2021-01-06 11:10:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:10:58,674 INFO L225 Difference]: With dead ends: 98 [2021-01-06 11:10:58,674 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 11:10:58,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:10:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 11:10:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2021-01-06 11:10:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 11:10:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-01-06 11:10:58,686 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 32 [2021-01-06 11:10:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:10:58,687 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-01-06 11:10:58,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:10:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-01-06 11:10:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:10:58,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:10:58,694 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:10:58,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:58,910 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:10:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:10:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 3 times [2021-01-06 11:10:58,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:10:58,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951046479] [2021-01-06 11:10:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:10:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:10:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 11:10:59,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951046479] [2021-01-06 11:10:59,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260857480] [2021-01-06 11:10:59,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:10:59,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 11:10:59,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:10:59,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-06 11:10:59,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:10:59,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 11:10:59,745 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:59,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:59,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:10:59,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-01-06 11:10:59,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:10:59,867 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:10:59,868 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:10:59,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:10:59,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:10:59,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-01-06 11:11:02,875 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 25 [2021-01-06 11:11:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:02,931 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:02,931 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 96 [2021-01-06 11:11:02,934 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:03,005 INFO L625 ElimStorePlain]: treesize reduction 48, result has 47.8 percent of original size [2021-01-06 11:11:03,007 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:03,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2021-01-06 11:11:04,987 WARN L197 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-01-06 11:11:13,071 WARN L197 SmtUtils]: Spent 3.10 s on a formula simplification that was a NOOP. DAG size: 35 [2021-01-06 11:11:28,544 WARN L197 SmtUtils]: Spent 3.38 s on a formula simplification that was a NOOP. DAG size: 34 [2021-01-06 11:11:33,861 WARN L197 SmtUtils]: Spent 3.25 s on a formula simplification that was a NOOP. DAG size: 36 [2021-01-06 11:11:33,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:33,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 11:11:33,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:33,906 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:33,907 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 84 [2021-01-06 11:11:33,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:33,979 INFO L625 ElimStorePlain]: treesize reduction 56, result has 50.0 percent of original size [2021-01-06 11:11:33,981 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:33,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:56 [2021-01-06 11:11:39,550 WARN L197 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 36 [2021-01-06 11:11:39,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:39,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:39,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:39,638 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:39,639 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 119 [2021-01-06 11:11:39,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:39,729 INFO L625 ElimStorePlain]: treesize reduction 40, result has 56.5 percent of original size [2021-01-06 11:11:39,731 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:39,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:52 [2021-01-06 11:11:43,338 WARN L197 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 37 [2021-01-06 11:11:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:43,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:43,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:43,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:43,402 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:43,402 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2021-01-06 11:11:43,405 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:43,486 INFO L625 ElimStorePlain]: treesize reduction 84, result has 39.6 percent of original size [2021-01-06 11:11:43,489 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:43,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:50 [2021-01-06 11:11:45,954 WARN L197 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2021-01-06 11:11:46,396 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-01-06 11:11:48,483 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2021-01-06 11:11:49,424 WARN L197 SmtUtils]: Spent 880.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 11:11:49,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:49,451 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:49,452 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2021-01-06 11:11:49,454 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:49,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:49,473 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:49,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:33 [2021-01-06 11:11:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:11:49,640 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:11:49,641 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 130 [2021-01-06 11:11:49,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:11:49,760 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-01-06 11:11:49,760 INFO L625 ElimStorePlain]: treesize reduction 50, result has 63.5 percent of original size [2021-01-06 11:11:49,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:11:49,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:87 [2021-01-06 11:11:49,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:11:49,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:11:49,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:11:49,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:11:49,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:11:49,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:11:49,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:11:49,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:11:49,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:12:17,202 WARN L197 SmtUtils]: Spent 27.11 s on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2021-01-06 11:12:53,423 WARN L197 SmtUtils]: Spent 36.08 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-01-06 11:12:53,436 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:12:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,529 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:12:53,530 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 78 [2021-01-06 11:12:53,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:12:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,650 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:12:53,650 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 130 [2021-01-06 11:12:53,656 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:12:53,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:12:53,753 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:12:53,754 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 130 [2021-01-06 11:12:53,758 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:12:54,185 WARN L197 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-01-06 11:12:54,186 INFO L625 ElimStorePlain]: treesize reduction 139, result has 64.0 percent of original size [2021-01-06 11:12:54,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2021-01-06 11:12:54,196 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:247 [2021-01-06 11:12:54,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:12:54,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,938 WARN L197 SmtUtils]: Spent 11.57 s on a formula simplification that was a NOOP. DAG size: 76 [2021-01-06 11:13:05,949 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:13:05,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:05,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:05,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:05,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:05,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:05,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:05,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:05,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:05,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:05,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:05,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:05,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:05,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:05,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:06,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:06,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,023 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:13:06,026 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:13:06,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:13:06,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:13:06,072 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:13:06,075 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:13:06,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:13:06,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:06,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:06,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:13:06,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:06,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:13:06,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:13:06,240 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26