/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/verifythis/prefixsum_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:21:45,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:21:45,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:21:45,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:21:45,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:21:45,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:21:45,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:21:45,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:21:45,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:21:45,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:21:45,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:21:45,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:21:45,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:21:45,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:21:45,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:21:45,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:21:45,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:21:45,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:21:45,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:21:45,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:21:45,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:21:45,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:21:45,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:21:45,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:21:45,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:21:45,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:21:45,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:21:45,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:21:45,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:21:45,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:21:45,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:21:45,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:21:45,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:21:45,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:21:45,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:21:45,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:21:45,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:21:45,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:21:45,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:21:45,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:21:45,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:21:45,704 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 19:21:45,762 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:21:45,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:21:45,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:21:45,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:21:45,769 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:21:45,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:21:45,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:21:45,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:21:45,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:21:45,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:21:45,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:21:45,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:21:45,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:21:45,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:21:45,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:21:45,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:21:45,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:21:45,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:21:45,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:21:45,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:21:45,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:21:45,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:21:45,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:21:45,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:21:45,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:21:45,775 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 19:21:46,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:21:46,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:21:46,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:21:46,216 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:21:46,217 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:21:46,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2021-01-06 19:21:46,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/799585c34/04611a396d4c49369bfc4b5bad5c2be2/FLAGd321b7229 [2021-01-06 19:21:46,905 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:21:46,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2021-01-06 19:21:46,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/799585c34/04611a396d4c49369bfc4b5bad5c2be2/FLAGd321b7229 [2021-01-06 19:21:47,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/799585c34/04611a396d4c49369bfc4b5bad5c2be2 [2021-01-06 19:21:47,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:21:47,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:21:47,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:47,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:21:47,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:21:47,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5faf2165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47, skipping insertion in model container [2021-01-06 19:21:47,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:21:47,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:21:47,458 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/verifythis/prefixsum_rec.c[525,538] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~left,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a0~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a0~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] 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],BinaryExpression[ARITHMINUS,IdentifierExpression[~n~0,],IntegerLiteral[1]]]]]] [2021-01-06 19:21:47,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:47,514 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:21:47,529 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/verifythis/prefixsum_rec.c[525,538] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~left,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a0~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a0~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] 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],BinaryExpression[ARITHMINUS,IdentifierExpression[~n~0,],IntegerLiteral[1]]]]]] [2021-01-06 19:21:47,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:47,576 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:21:47,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47 WrapperNode [2021-01-06 19:21:47,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:47,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:47,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:21:47,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:21:47,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:47,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:21:47,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:21:47,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:21:47,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (1/1) ... [2021-01-06 19:21:47,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:21:47,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:21:47,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:21:47,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:21:47,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (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 19:21:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:21:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:21:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2021-01-06 19:21:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2021-01-06 19:21:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 19:21:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 19:21:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2021-01-06 19:21:47,877 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2021-01-06 19:21:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:21:47,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:21:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 19:21:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 19:21:48,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:21:48,397 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-01-06 19:21:48,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:48 BoogieIcfgContainer [2021-01-06 19:21:48,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:21:48,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:21:48,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:21:48,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:21:48,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:21:47" (1/3) ... [2021-01-06 19:21:48,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ede264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:48, skipping insertion in model container [2021-01-06 19:21:48,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:47" (2/3) ... [2021-01-06 19:21:48,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ede264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:48, skipping insertion in model container [2021-01-06 19:21:48,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:48" (3/3) ... [2021-01-06 19:21:48,413 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2021-01-06 19:21:48,424 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:21:48,431 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:21:48,453 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:21:48,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:21:48,500 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:21:48,500 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:21:48,500 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:21:48,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:21:48,501 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:21:48,501 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:21:48,501 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:21:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2021-01-06 19:21:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:21:48,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:48,535 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:48,535 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1112089738, now seen corresponding path program 1 times [2021-01-06 19:21:48,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:48,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991958133] [2021-01-06 19:21:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-06 19:21:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-01-06 19:21:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:48,785 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 19:21:48,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991958133] [2021-01-06 19:21:48,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:48,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:21:48,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127161010] [2021-01-06 19:21:48,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:21:48,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:21:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:21:48,809 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2021-01-06 19:21:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:48,905 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2021-01-06 19:21:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:21:48,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 19:21:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:48,915 INFO L225 Difference]: With dead ends: 78 [2021-01-06 19:21:48,916 INFO L226 Difference]: Without dead ends: 37 [2021-01-06 19:21:48,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:21:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-01-06 19:21:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-01-06 19:21:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 19:21:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-01-06 19:21:48,965 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2021-01-06 19:21:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:48,965 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-01-06 19:21:48,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:21:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-01-06 19:21:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:21:48,968 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:48,968 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:48,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:21:48,969 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -627348298, now seen corresponding path program 1 times [2021-01-06 19:21:48,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:48,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756312511] [2021-01-06 19:21:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-06 19:21:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-01-06 19:21:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,273 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 19:21:49,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756312511] [2021-01-06 19:21:49,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:49,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:21:49,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254727776] [2021-01-06 19:21:49,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:21:49,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:21:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:21:49,278 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 7 states. [2021-01-06 19:21:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:49,630 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2021-01-06 19:21:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:21:49,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2021-01-06 19:21:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:49,634 INFO L225 Difference]: With dead ends: 76 [2021-01-06 19:21:49,634 INFO L226 Difference]: Without dead ends: 60 [2021-01-06 19:21:49,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:21:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-06 19:21:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2021-01-06 19:21:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-01-06 19:21:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-01-06 19:21:49,647 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 28 [2021-01-06 19:21:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:49,648 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-01-06 19:21:49,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:21:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-01-06 19:21:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 19:21:49,650 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:49,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:49,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:21:49,651 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -250977996, now seen corresponding path program 1 times [2021-01-06 19:21:49,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:49,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065169681] [2021-01-06 19:21:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-01-06 19:21:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:21:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:49,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065169681] [2021-01-06 19:21:49,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059357072] [2021-01-06 19:21:49,956 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 19:21:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:50,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:21:50,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:50,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:50,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-01-06 19:21:50,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378289066] [2021-01-06 19:21:50,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:21:50,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:21:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:21:50,431 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2021-01-06 19:21:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:50,774 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2021-01-06 19:21:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:21:50,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2021-01-06 19:21:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:50,776 INFO L225 Difference]: With dead ends: 64 [2021-01-06 19:21:50,776 INFO L226 Difference]: Without dead ends: 41 [2021-01-06 19:21:50,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:21:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-01-06 19:21:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-01-06 19:21:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 19:21:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-01-06 19:21:50,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 30 [2021-01-06 19:21:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:50,786 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-01-06 19:21:50,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:21:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-01-06 19:21:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 19:21:50,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:50,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:51,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 19:21:51,002 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 663629362, now seen corresponding path program 2 times [2021-01-06 19:21:51,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:51,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627997233] [2021-01-06 19:21:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,707 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2021-01-06 19:21:51,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:21:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:51,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:21:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,146 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2021-01-06 19:21:53,866 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-01-06 19:21:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:54,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627997233] [2021-01-06 19:21:54,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485427274] [2021-01-06 19:21:54,098 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 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 19:21:54,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 19:21:54,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:21:54,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 67 conjunts are in the unsatisfiable core [2021-01-06 19:21:54,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:54,676 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 16 treesize of output 12 [2021-01-06 19:21:54,678 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:54,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:54,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:21:54,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-01-06 19:21:54,938 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:54,939 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 3 case distinctions, treesize of input 70 treesize of output 97 [2021-01-06 19:21:54,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 19:21:54,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:21:54,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:54,965 INFO L625 ElimStorePlain]: treesize reduction 23, result has 52.1 percent of original size [2021-01-06 19:21:54,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:21:54,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:25 [2021-01-06 19:21:55,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:21:55,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 19:21:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:21:55,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:21:55,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2021-01-06 19:21:55,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056584239] [2021-01-06 19:21:55,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:21:55,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:21:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2021-01-06 19:21:55,305 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 13 states. [2021-01-06 19:21:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:56,060 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2021-01-06 19:21:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:21:56,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2021-01-06 19:21:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:56,064 INFO L225 Difference]: With dead ends: 67 [2021-01-06 19:21:56,064 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 19:21:56,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 19:21:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 19:21:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2021-01-06 19:21:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-01-06 19:21:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2021-01-06 19:21:56,079 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 32 [2021-01-06 19:21:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:56,079 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2021-01-06 19:21:56,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:21:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2021-01-06 19:21:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 19:21:56,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:56,082 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:56,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:56,296 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1120401257, now seen corresponding path program 1 times [2021-01-06 19:21:56,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:56,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928489992] [2021-01-06 19:21:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:21:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:21:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:21:56,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928489992] [2021-01-06 19:21:56,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355200795] [2021-01-06 19:21:56,498 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 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 19:21:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 88 conjunts are in the unsatisfiable core [2021-01-06 19:21:56,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:56,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-01-06 19:21:56,667 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,680 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 7 treesize of output 6 [2021-01-06 19:21:56,681 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,690 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,690 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-01-06 19:21:56,759 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,761 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 19:21:56,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:21:56,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,791 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 14 treesize of output 16 [2021-01-06 19:21:56,793 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,804 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,804 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2021-01-06 19:21:56,877 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 32 [2021-01-06 19:21:56,879 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:21:56,893 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2021-01-06 19:21:56,964 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 32 [2021-01-06 19:21:56,966 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:21:56,990 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.0 percent of original size [2021-01-06 19:21:56,992 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 19:21:56,992 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:40 [2021-01-06 19:22:04,792 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 46 treesize of output 40 [2021-01-06 19:22:04,794 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,831 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.5 percent of original size [2021-01-06 19:22:04,839 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 19:22:04,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:63 [2021-01-06 19:22:04,906 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 29 treesize of output 27 [2021-01-06 19:22:04,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2021-01-06 19:22:05,688 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~tmp~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* |c_downsweep_#in~left| 4) |c_downsweep_#in~a.offset|))) (store (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse0 .cse1)))) .cse2 downsweep_~tmp~0))))) is different from true [2021-01-06 19:22:05,708 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 61 treesize of output 55 [2021-01-06 19:22:05,710 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:05,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:05,725 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 19:22:05,725 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:61 [2021-01-06 19:22:06,443 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-01-06 19:22:07,228 WARN L197 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-01-06 19:22:08,083 WARN L197 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-01-06 19:22:08,849 WARN L197 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-01-06 19:22:08,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:08,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:08,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 19:22:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:09,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:09,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 27 [2021-01-06 19:22:09,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276736109] [2021-01-06 19:22:09,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-06 19:22:09,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-06 19:22:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=573, Unknown=5, NotChecked=48, Total=702 [2021-01-06 19:22:09,423 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 27 states. [2021-01-06 19:22:25,022 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 33 [2021-01-06 19:22:31,500 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 19:22:33,263 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 61 [2021-01-06 19:22:36,969 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 63 [2021-01-06 19:22:37,790 WARN L197 SmtUtils]: Spent 750.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-01-06 19:22:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:38,377 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2021-01-06 19:22:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-06 19:22:38,377 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2021-01-06 19:22:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:38,379 INFO L225 Difference]: With dead ends: 144 [2021-01-06 19:22:38,379 INFO L226 Difference]: Without dead ends: 111 [2021-01-06 19:22:38,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=318, Invalid=2228, Unknown=8, NotChecked=98, Total=2652 [2021-01-06 19:22:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-01-06 19:22:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2021-01-06 19:22:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-06 19:22:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2021-01-06 19:22:38,400 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2021-01-06 19:22:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:38,400 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2021-01-06 19:22:38,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-06 19:22:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2021-01-06 19:22:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:22:38,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:38,403 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:38,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:38,615 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:38,616 INFO L82 PathProgramCache]: Analyzing trace with hash 451063962, now seen corresponding path program 1 times [2021-01-06 19:22:38,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:38,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812757554] [2021-01-06 19:22:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-01-06 19:22:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-01-06 19:22:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 19:22:38,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812757554] [2021-01-06 19:22:38,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776248789] [2021-01-06 19:22:38,725 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 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 19:22:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 19:22:38,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 19:22:38,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:38,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2021-01-06 19:22:38,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014476456] [2021-01-06 19:22:38,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:22:38,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:22:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:22:38,905 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 12 states. [2021-01-06 19:22:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:39,144 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2021-01-06 19:22:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:22:39,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2021-01-06 19:22:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:39,146 INFO L225 Difference]: With dead ends: 100 [2021-01-06 19:22:39,147 INFO L226 Difference]: Without dead ends: 80 [2021-01-06 19:22:39,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:22:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-06 19:22:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-01-06 19:22:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-06 19:22:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2021-01-06 19:22:39,162 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 39 [2021-01-06 19:22:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:39,163 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-01-06 19:22:39,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 19:22:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2021-01-06 19:22:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:22:39,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:39,165 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:39,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:39,380 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1049653485, now seen corresponding path program 2 times [2021-01-06 19:22:39,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:39,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791271416] [2021-01-06 19:22:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:39,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:39,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-01-06 19:22:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:39,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791271416] [2021-01-06 19:22:39,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857066697] [2021-01-06 19:22:39,528 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 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 19:22:39,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:22:39,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:39,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:22:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:22:39,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:39,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2021-01-06 19:22:39,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652758471] [2021-01-06 19:22:39,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 19:22:39,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 19:22:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:22:39,786 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 15 states. [2021-01-06 19:22:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:40,084 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2021-01-06 19:22:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:22:40,084 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2021-01-06 19:22:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:40,087 INFO L225 Difference]: With dead ends: 104 [2021-01-06 19:22:40,088 INFO L226 Difference]: Without dead ends: 88 [2021-01-06 19:22:40,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:22:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-06 19:22:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2021-01-06 19:22:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-06 19:22:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2021-01-06 19:22:40,115 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 41 [2021-01-06 19:22:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:40,116 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-01-06 19:22:40,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 19:22:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2021-01-06 19:22:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 19:22:40,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:40,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:40,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 19:22:40,340 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 207235141, now seen corresponding path program 1 times [2021-01-06 19:22:40,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:40,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499382940] [2021-01-06 19:22:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-01-06 19:22:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:22:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:22:40,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499382940] [2021-01-06 19:22:40,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375110164] [2021-01-06 19:22:40,486 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 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 19:22:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:22:40,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:22:40,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:40,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-01-06 19:22:40,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771773956] [2021-01-06 19:22:40,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:22:40,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:22:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:22:40,778 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2021-01-06 19:22:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:41,296 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2021-01-06 19:22:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:22:41,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2021-01-06 19:22:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:41,298 INFO L225 Difference]: With dead ends: 73 [2021-01-06 19:22:41,299 INFO L226 Difference]: Without dead ends: 59 [2021-01-06 19:22:41,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2021-01-06 19:22:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-01-06 19:22:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-01-06 19:22:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 19:22:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-01-06 19:22:41,307 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 43 [2021-01-06 19:22:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:41,307 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-01-06 19:22:41,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:22:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-01-06 19:22:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:22:41,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:41,308 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:41,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:41,525 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -421543614, now seen corresponding path program 1 times [2021-01-06 19:22:41,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:41,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677740097] [2021-01-06 19:22:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-01-06 19:22:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:22:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:41,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677740097] [2021-01-06 19:22:41,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302979701] [2021-01-06 19:22:41,648 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 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 19:22:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 19:22:41,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:41,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:41,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2021-01-06 19:22:41,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489405313] [2021-01-06 19:22:41,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:22:41,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:41,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:22:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:22:41,853 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 11 states. [2021-01-06 19:22:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:42,015 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2021-01-06 19:22:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:22:42,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2021-01-06 19:22:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:42,017 INFO L225 Difference]: With dead ends: 53 [2021-01-06 19:22:42,017 INFO L226 Difference]: Without dead ends: 46 [2021-01-06 19:22:42,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:22:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-06 19:22:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-01-06 19:22:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 19:22:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2021-01-06 19:22:42,025 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 46 [2021-01-06 19:22:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:42,025 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-01-06 19:22:42,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:22:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2021-01-06 19:22:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 19:22:42,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:42,026 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:42,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:42,232 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:42,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash -156199390, now seen corresponding path program 1 times [2021-01-06 19:22:42,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:42,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191440987] [2021-01-06 19:22:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-01-06 19:22:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:22:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:22:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-06 19:22:42,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191440987] [2021-01-06 19:22:42,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87278416] [2021-01-06 19:22:42,540 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 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 19:22:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:42,694 WARN L261 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 152 conjunts are in the unsatisfiable core [2021-01-06 19:22:42,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:42,766 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-01-06 19:22:42,767 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,779 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 7 treesize of output 6 [2021-01-06 19:22:42,780 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,788 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,788 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-01-06 19:22:42,848 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,849 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 19:22:42,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:42,852 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,862 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,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 14 treesize of output 16 [2021-01-06 19:22:42,868 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,878 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,879 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2021-01-06 19:22:42,954 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 32 [2021-01-06 19:22:42,955 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:42,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:42,969 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2021-01-06 19:22:43,047 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 32 [2021-01-06 19:22:43,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:43,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:43,062 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:43,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2021-01-06 19:22:43,148 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 32 [2021-01-06 19:22:43,149 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:43,179 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.0 percent of original size [2021-01-06 19:22:43,181 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 19:22:43,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:40 [2021-01-06 19:22:45,236 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 19:22:47,298 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 19:22:49,359 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2021-01-06 19:22:51,499 WARN L860 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse1 (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|)) (.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)))))))) is different from true [2021-01-06 19:22:55,564 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2021-01-06 19:23:03,668 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2021-01-06 19:23:09,808 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 244 treesize of output 208 [2021-01-06 19:23:09,810 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:09,840 INFO L625 ElimStorePlain]: treesize reduction 3, result has 98.8 percent of original size [2021-01-06 19:23:09,842 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-06 19:23:09,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:266, output treesize:238 [2021-01-06 19:23:09,937 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 39 treesize of output 37 [2021-01-06 19:23:09,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:09,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:09,950 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 19:23:09,951 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2021-01-06 19:23:12,181 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (downsweep_~tmp~0 Int)) (and (<= downsweep_~left |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* downsweep_~left 4) |c_downsweep_#in~a.offset|))) (store (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse0 .cse1)))) .cse2 downsweep_~tmp~0)))))) is different from true [2021-01-06 19:23:16,304 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2021-01-06 19:23:18,327 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (downsweep_~right Int) (downsweep_~tmp~0 Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (<= |c_downsweep_#in~left| downsweep_~left) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* downsweep_~left 4) downsweep_~a.offset))) (store (let ((.cse1 (+ (* downsweep_~right 4) downsweep_~a.offset)) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 downsweep_~tmp~0)))) (<= |c_downsweep_#in~right| downsweep_~right))) is different from true [2021-01-06 19:23:24,575 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 57 [2021-01-06 19:23:24,812 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 624 treesize of output 576 [2021-01-06 19:23:24,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:25,006 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2021-01-06 19:23:25,007 INFO L625 ElimStorePlain]: treesize reduction 29, result has 96.1 percent of original size [2021-01-06 19:23:25,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2021-01-06 19:23:25,080 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:781, output treesize:721 [2021-01-06 19:23:27,165 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a0~0.base Int) (ULTIMATE.start_main_~a0~0.offset Int)) (and (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 (+ ULTIMATE.start_main_~a0~0.offset 8) (select .cse0 (+ c_ULTIMATE.start_main_~a~0.offset 8)))) (select |c_#memory_int| ULTIMATE.start_main_~a0~0.base)) (not (= ULTIMATE.start_main_~a0~0.base c_ULTIMATE.start_main_~a~0.base)))) (exists ((v_downsweep_~a.offset_6 Int) (v_downsweep_~left_6 Int) (aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 Int) (aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 Int) (aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 Int) (v_downsweep_~tmp~0_2 Int) (aux_div_ULTIMATE.start_main_~n~0_32 Int) (downsweep_~tmp~0 Int) (v_downsweep_~right_6 Int) (downsweep_~left Int) (aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 Int) (aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 Int)) (let ((.cse4 (* 2 aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129)) (.cse5 (* 4 aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129))) (let ((.cse2 (* 4 aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)) (.cse3 (* 2 aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)) (.cse1 (+ .cse4 .cse5))) (and (<= .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 3)) (< aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 2) (< .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (* 2 aux_div_ULTIMATE.start_main_~n~0_32) 2)) (<= .cse1 (+ .cse2 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 .cse3)) (< (+ .cse2 .cse3 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198) (+ .cse4 .cse5 2)) (< (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 aux_div_ULTIMATE.start_main_~n~0_32 1) .cse1) (<= c_ULTIMATE.start_main_~a~0.offset v_downsweep_~a.offset_6) (<= .cse1 (+ downsweep_~left aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 1)) (< aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 2) (<= .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 v_downsweep_~right_6 1)) (= (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) (let ((.cse8 (+ v_downsweep_~a.offset_6 (* downsweep_~left 4)))) (store (let ((.cse6 (let ((.cse12 (+ (* v_downsweep_~left_6 4) c_ULTIMATE.start_main_~a~0.offset))) (store (let ((.cse13 ((as const (Array Int Int)) 0)) (.cse14 (+ (* aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 8) c_ULTIMATE.start_main_~a~0.offset (* aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (- 4)) (* aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 16) (- 4)))) (let ((.cse11 (select .cse13 .cse14)) (.cse10 (+ c_ULTIMATE.start_main_~a~0.offset (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 2) (* aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (- 1)) (* aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 4)) 2) 4) (- 4)))) (let ((.cse9 (store .cse13 .cse14 (+ .cse11 (select .cse13 .cse10))))) (store .cse9 .cse10 (+ .cse11 (select (store .cse9 .cse10 .cse11) .cse12)))))) .cse12 downsweep_~tmp~0))) (.cse7 (+ v_downsweep_~a.offset_6 (* v_downsweep_~right_6 4)))) (store .cse6 .cse7 (+ (select .cse6 .cse8) (select .cse6 .cse7)))) .cse8 v_downsweep_~tmp~0_2))) (<= 0 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198) (< aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129) (<= (+ v_downsweep_~left_6 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 1) (+ aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129)) (<= 0 aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)))))) is different from true [2021-01-06 19:23:31,540 WARN L197 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 108 [2021-01-06 19:23:31,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:23:31,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:23:31,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:23:31,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:23:31,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-06 19:23:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 13 not checked. [2021-01-06 19:23:31,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:31,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 38 [2021-01-06 19:23:31,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446159053] [2021-01-06 19:23:31,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-06 19:23:31,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-06 19:23:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1028, Unknown=14, NotChecked=268, Total=1406 [2021-01-06 19:23:31,836 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 38 states. [2021-01-06 19:23:43,631 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 19:24:26,732 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2021-01-06 19:25:01,648 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 114 [2021-01-06 19:25:12,176 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 118 [2021-01-06 19:25:18,444 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 120 [2021-01-06 19:25:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:26,925 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2021-01-06 19:25:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-06 19:25:26,926 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2021-01-06 19:25:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:26,928 INFO L225 Difference]: With dead ends: 112 [2021-01-06 19:25:26,928 INFO L226 Difference]: Without dead ends: 71 [2021-01-06 19:25:26,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=231, Invalid=2627, Unknown=20, NotChecked=428, Total=3306 [2021-01-06 19:25:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-06 19:25:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2021-01-06 19:25:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-06 19:25:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2021-01-06 19:25:26,960 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 56 [2021-01-06 19:25:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:26,960 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2021-01-06 19:25:26,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-06 19:25:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2021-01-06 19:25:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 19:25:26,963 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:26,963 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:27,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 19:25:27,167 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1334063917, now seen corresponding path program 1 times [2021-01-06 19:25:27,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:27,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377299359] [2021-01-06 19:25:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,907 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2021-01-06 19:25:29,205 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-01-06 19:25:32,091 WARN L197 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-01-06 19:25:32,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:25:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:32,923 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2021-01-06 19:25:33,394 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2021-01-06 19:25:33,936 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2021-01-06 19:25:33,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:34,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:34,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-01-06 19:25:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat