/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 21:59:41,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 21:59:41,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 21:59:41,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 21:59:41,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 21:59:41,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 21:59:41,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 21:59:41,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 21:59:41,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 21:59:41,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 21:59:41,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 21:59:41,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 21:59:41,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 21:59:41,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 21:59:41,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 21:59:41,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 21:59:41,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 21:59:41,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 21:59:41,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 21:59:41,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 21:59:41,625 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 21:59:41,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 21:59:41,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 21:59:41,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 21:59:41,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 21:59:41,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 21:59:41,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 21:59:41,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 21:59:41,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 21:59:41,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 21:59:41,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 21:59:41,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 21:59:41,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 21:59:41,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 21:59:41,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 21:59:41,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 21:59:41,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 21:59:41,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 21:59:41,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 21:59:41,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 21:59:41,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 21:59:41,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 21:59:41,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-19 21:59:41,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 21:59:41,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 21:59:41,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 21:59:41,673 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 21:59:41,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 21:59:41,674 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 21:59:41,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 21:59:41,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 21:59:41,675 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 21:59:41,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 21:59:41,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 21:59:41,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 21:59:41,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 21:59:41,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 21:59:41,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:41,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 21:59:41,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 21:59:41,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 21:59:41,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 21:59:41,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 21:59:41,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 21:59:41,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 21:59:41,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 21:59:41,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 21:59:41,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 21:59:41,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 21:59:41,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 21:59:41,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 21:59:41,911 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 21:59:41,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-03-19 21:59:41,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4c1e1e8/f9fd71146e314ada9c2cd89e0561d18e/FLAG6d9ae311c [2022-03-19 21:59:42,351 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 21:59:42,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-03-19 21:59:42,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4c1e1e8/f9fd71146e314ada9c2cd89e0561d18e/FLAG6d9ae311c [2022-03-19 21:59:42,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4c1e1e8/f9fd71146e314ada9c2cd89e0561d18e [2022-03-19 21:59:42,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 21:59:42,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 21:59:42,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:42,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 21:59:42,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 21:59:42,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:42" (1/1) ... [2022-03-19 21:59:42,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d19403a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:42, skipping insertion in model container [2022-03-19 21:59:42,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:42" (1/1) ... [2022-03-19 21:59:42,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 21:59:42,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 21:59:42,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-03-19 21:59:42,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:42,961 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 21:59:42,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-03-19 21:59:42,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:43,004 INFO L208 MainTranslator]: Completed translation [2022-03-19 21:59:43,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43 WrapperNode [2022-03-19 21:59:43,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:43,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 21:59:43,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 21:59:43,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 21:59:43,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 21:59:43,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 21:59:43,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 21:59:43,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 21:59:43,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:43,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 21:59:43,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 21:59:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 21:59:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 21:59:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 21:59:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 21:59:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2022-03-19 21:59:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2022-03-19 21:59:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 21:59:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 21:59:43,202 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 21:59:43,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 21:59:43,395 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 21:59:43,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 21:59:43,400 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-19 21:59:43,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:43 BoogieIcfgContainer [2022-03-19 21:59:43,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 21:59:43,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 21:59:43,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 21:59:43,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 21:59:43,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 09:59:42" (1/3) ... [2022-03-19 21:59:43,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69794347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:43, skipping insertion in model container [2022-03-19 21:59:43,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (2/3) ... [2022-03-19 21:59:43,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69794347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:43, skipping insertion in model container [2022-03-19 21:59:43,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:43" (3/3) ... [2022-03-19 21:59:43,414 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-03-19 21:59:43,419 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 21:59:43,419 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 21:59:43,472 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 21:59:43,480 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 21:59:43,480 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 21:59:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 21:59:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 21:59:43,509 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:43,510 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:43,510 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1995632546, now seen corresponding path program 1 times [2022-03-19 21:59:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670349386] [2022-03-19 21:59:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:43,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670349386] [2022-03-19 21:59:43,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670349386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:43,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:43,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 21:59:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507814300] [2022-03-19 21:59:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:43,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 21:59:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 21:59:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 21:59:43,805 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:43,954 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-03-19 21:59:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 21:59:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-03-19 21:59:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:43,966 INFO L225 Difference]: With dead ends: 77 [2022-03-19 21:59:43,966 INFO L226 Difference]: Without dead ends: 43 [2022-03-19 21:59:43,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 21:59:43,971 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:43,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-19 21:59:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-03-19 21:59:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-03-19 21:59:44,004 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-03-19 21:59:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:44,005 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-03-19 21:59:44,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-03-19 21:59:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 21:59:44,006 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:44,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:44,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 21:59:44,006 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1221136232, now seen corresponding path program 1 times [2022-03-19 21:59:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:44,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958092643] [2022-03-19 21:59:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:44,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:44,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958092643] [2022-03-19 21:59:44,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958092643] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:44,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:44,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 21:59:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66574985] [2022-03-19 21:59:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:44,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 21:59:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 21:59:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 21:59:44,138 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:44,277 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-03-19 21:59:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 21:59:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-03-19 21:59:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:44,280 INFO L225 Difference]: With dead ends: 59 [2022-03-19 21:59:44,280 INFO L226 Difference]: Without dead ends: 38 [2022-03-19 21:59:44,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 21:59:44,284 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:44,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-19 21:59:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-03-19 21:59:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-03-19 21:59:44,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-03-19 21:59:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:44,295 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-03-19 21:59:44,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-03-19 21:59:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 21:59:44,297 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:44,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:44,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 21:59:44,298 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -957735862, now seen corresponding path program 1 times [2022-03-19 21:59:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:44,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924526764] [2022-03-19 21:59:44,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 21:59:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:44,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924526764] [2022-03-19 21:59:44,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924526764] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:44,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050172378] [2022-03-19 21:59:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:44,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:44,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 21:59:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 21:59:44,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:44,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:44,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050172378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:44,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:44,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-03-19 21:59:44,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674139405] [2022-03-19 21:59:44,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:44,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 21:59:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:44,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 21:59:44,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-19 21:59:44,618 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 21:59:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:44,839 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-03-19 21:59:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 21:59:44,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-03-19 21:59:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:44,841 INFO L225 Difference]: With dead ends: 68 [2022-03-19 21:59:44,841 INFO L226 Difference]: Without dead ends: 47 [2022-03-19 21:59:44,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-19 21:59:44,843 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:44,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-19 21:59:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-03-19 21:59:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-03-19 21:59:44,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-03-19 21:59:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:44,862 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-03-19 21:59:44,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 21:59:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-03-19 21:59:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-19 21:59:44,863 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:44,863 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:44,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 21:59:45,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:45,088 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1685086224, now seen corresponding path program 2 times [2022-03-19 21:59:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:45,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677309655] [2022-03-19 21:59:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-19 21:59:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-19 21:59:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677309655] [2022-03-19 21:59:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677309655] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:45,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:45,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 21:59:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682774557] [2022-03-19 21:59:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:45,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 21:59:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 21:59:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-19 21:59:45,203 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:45,387 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-03-19 21:59:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 21:59:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-03-19 21:59:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:45,389 INFO L225 Difference]: With dead ends: 55 [2022-03-19 21:59:45,389 INFO L226 Difference]: Without dead ends: 42 [2022-03-19 21:59:45,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-19 21:59:45,398 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:45,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-19 21:59:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-03-19 21:59:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-03-19 21:59:45,416 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-03-19 21:59:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:45,416 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-03-19 21:59:45,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-03-19 21:59:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-19 21:59:45,418 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:45,418 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:45,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 21:59:45,419 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -476963320, now seen corresponding path program 1 times [2022-03-19 21:59:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95637896] [2022-03-19 21:59:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-19 21:59:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-19 21:59:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95637896] [2022-03-19 21:59:45,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95637896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:45,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489746217] [2022-03-19 21:59:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:45,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:45,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 21:59:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-19 21:59:45,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:45,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:45,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489746217] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:45,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:45,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-19 21:59:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576586423] [2022-03-19 21:59:45,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:45,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 21:59:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:45,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 21:59:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-19 21:59:45,837 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:46,225 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-03-19 21:59:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-19 21:59:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2022-03-19 21:59:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:46,227 INFO L225 Difference]: With dead ends: 85 [2022-03-19 21:59:46,227 INFO L226 Difference]: Without dead ends: 63 [2022-03-19 21:59:46,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2022-03-19 21:59:46,228 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:46,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 34 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 21:59:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-19 21:59:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2022-03-19 21:59:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-03-19 21:59:46,235 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-03-19 21:59:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:46,235 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-03-19 21:59:46,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-03-19 21:59:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-19 21:59:46,236 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:46,236 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:46,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 21:59:46,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:46,437 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1852858010, now seen corresponding path program 1 times [2022-03-19 21:59:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:46,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976907940] [2022-03-19 21:59:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 21:59:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-19 21:59:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976907940] [2022-03-19 21:59:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976907940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637458164] [2022-03-19 21:59:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:46,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:46,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:46,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 21:59:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-19 21:59:46,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 21:59:46,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 21:59:46,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637458164] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:46,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:46,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2022-03-19 21:59:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741481797] [2022-03-19 21:59:46,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:46,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 21:59:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:46,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 21:59:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-19 21:59:46,929 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:47,501 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2022-03-19 21:59:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-19 21:59:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-03-19 21:59:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:47,503 INFO L225 Difference]: With dead ends: 96 [2022-03-19 21:59:47,503 INFO L226 Difference]: Without dead ends: 77 [2022-03-19 21:59:47,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-19 21:59:47,504 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 234 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:47,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 27 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 21:59:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-19 21:59:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-03-19 21:59:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-03-19 21:59:47,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-03-19 21:59:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:47,514 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-03-19 21:59:47,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-03-19 21:59:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-19 21:59:47,516 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:47,516 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:47,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 21:59:47,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:47,741 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1873855898, now seen corresponding path program 2 times [2022-03-19 21:59:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:47,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037002242] [2022-03-19 21:59:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 21:59:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-19 21:59:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:47,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037002242] [2022-03-19 21:59:47,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037002242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:47,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617846301] [2022-03-19 21:59:47,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 21:59:47,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:47,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:47,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:47,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 21:59:47,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 21:59:47,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 21:59:47,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-19 21:59:47,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-19 21:59:48,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-19 21:59:48,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617846301] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:48,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:48,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2022-03-19 21:59:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125668912] [2022-03-19 21:59:48,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:48,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-19 21:59:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-19 21:59:48,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-19 21:59:48,553 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:48,811 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-03-19 21:59:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 21:59:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 67 [2022-03-19 21:59:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:48,813 INFO L225 Difference]: With dead ends: 97 [2022-03-19 21:59:48,813 INFO L226 Difference]: Without dead ends: 84 [2022-03-19 21:59:48,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2022-03-19 21:59:48,814 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 197 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:48,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 25 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:48,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-19 21:59:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-03-19 21:59:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-03-19 21:59:48,826 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 67 [2022-03-19 21:59:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:48,826 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-03-19 21:59:48,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 21:59:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-03-19 21:59:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-19 21:59:48,828 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:48,828 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:48,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-19 21:59:49,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:49,043 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash -938103862, now seen corresponding path program 3 times [2022-03-19 21:59:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138000408] [2022-03-19 21:59:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 21:59:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-03-19 21:59:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138000408] [2022-03-19 21:59:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138000408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811757208] [2022-03-19 21:59:49,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 21:59:49,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:49,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:49,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 21:59:49,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-19 21:59:49,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 21:59:49,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-19 21:59:49,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-03-19 21:59:49,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 21:59:49,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811757208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:49,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 21:59:49,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2022-03-19 21:59:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533542249] [2022-03-19 21:59:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:49,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 21:59:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 21:59:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-03-19 21:59:49,441 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 21:59:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:49,484 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-03-19 21:59:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 21:59:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2022-03-19 21:59:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:49,486 INFO L225 Difference]: With dead ends: 117 [2022-03-19 21:59:49,486 INFO L226 Difference]: Without dead ends: 95 [2022-03-19 21:59:49,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-19 21:59:49,487 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:49,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 21:59:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-19 21:59:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-03-19 21:59:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-03-19 21:59:49,498 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 75 [2022-03-19 21:59:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:49,499 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-03-19 21:59:49,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 21:59:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-03-19 21:59:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-19 21:59:49,500 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:49,500 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:49,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-19 21:59:49,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:49,715 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 338841578, now seen corresponding path program 4 times [2022-03-19 21:59:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908205788] [2022-03-19 21:59:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 21:59:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-03-19 21:59:50,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908205788] [2022-03-19 21:59:50,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908205788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716371058] [2022-03-19 21:59:50,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 21:59:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:50,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 21:59:50,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-19 21:59:50,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 21:59:50,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 21:59:50,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-19 21:59:50,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:50,863 INFO L356 Elim1Store]: treesize reduction 274, result has 11.6 percent of original size [2022-03-19 21:59:50,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 57 [2022-03-19 21:59:51,069 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-19 21:59:51,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2022-03-19 21:59:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-19 21:59:51,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:51,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2022-03-19 21:59:51,983 INFO L356 Elim1Store]: treesize reduction 117, result has 54.3 percent of original size [2022-03-19 21:59:51,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 564 treesize of output 615 [2022-03-19 21:59:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 165 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-19 21:59:52,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716371058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:52,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:52,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 16] total 48 [2022-03-19 21:59:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189148578] [2022-03-19 21:59:52,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:52,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-19 21:59:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-19 21:59:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2022-03-19 21:59:52,661 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-19 22:00:01,167 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (forall ((v_ArrVal_275 Int) (v_ArrVal_274 Int)) (let ((.cse3 (* c_SelectionSort_~lh~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (+ .cse3 |c_~#array~0.offset|))) (or (< v_ArrVal_274 (select .cse0 .cse1)) (let ((.cse2 (store (store .cse0 .cse1 v_ArrVal_275) (+ |c_~#array~0.offset| (* c_SelectionSort_~i~0 4) 4) v_ArrVal_274))) (<= (select .cse2 (+ .cse3 |c_~#array~0.offset| 8)) (select .cse2 (+ .cse3 |c_~#array~0.offset| 12)))))))) (let ((.cse4 (* 4 c_SelectionSort_~rh~0)) (.cse5 (* c_SelectionSort_~i~0 4))) (or (= .cse4 (+ .cse5 4)) (let ((.cse6 (* c_SelectionSort_~lh~0 4))) (and (= .cse5 (+ .cse6 4)) (= .cse4 .cse6))) (= .cse4 .cse5))) (= |c_old(~n~0)| c_~n~0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-19 22:00:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:11,022 INFO L93 Difference]: Finished difference Result 311 states and 403 transitions. [2022-03-19 22:00:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-19 22:00:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-03-19 22:00:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:11,024 INFO L225 Difference]: With dead ends: 311 [2022-03-19 22:00:11,024 INFO L226 Difference]: Without dead ends: 247 [2022-03-19 22:00:11,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=835, Invalid=10084, Unknown=5, NotChecked=206, Total=11130 [2022-03-19 22:00:11,030 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 172 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:11,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 77 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1463 Invalid, 0 Unknown, 674 Unchecked, 0.8s Time] [2022-03-19 22:00:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-03-19 22:00:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2022-03-19 22:00:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 172 states have (on average 1.319767441860465) internal successors, (227), 172 states have internal predecessors, (227), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:00:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 234 transitions. [2022-03-19 22:00:11,056 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 234 transitions. Word has length 78 [2022-03-19 22:00:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:11,056 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 234 transitions. [2022-03-19 22:00:11,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-19 22:00:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 234 transitions. [2022-03-19 22:00:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-19 22:00:11,057 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:11,057 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:00:11,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-19 22:00:11,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:11,268 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1355409194, now seen corresponding path program 1 times [2022-03-19 22:00:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:11,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718069309] [2022-03-19 22:00:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:11,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:11,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:11,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:00:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 121 proven. 61 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-03-19 22:00:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718069309] [2022-03-19 22:00:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718069309] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055681364] [2022-03-19 22:00:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:12,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:00:12,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-19 22:00:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:12,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-19 22:00:12,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:12,375 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:00:12,376 INFO L390 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 11 [2022-03-19 22:00:12,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-19 22:00:13,059 INFO L390 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 [2022-03-19 22:00:13,143 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-19 22:00:13,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-03-19 22:00:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-03-19 22:00:13,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:13,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_362) |c_main_~#array~1.base|) |c_main_~#array~1.offset|) 0)) is different from false [2022-03-19 22:00:13,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055681364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:13,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:00:13,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 40 [2022-03-19 22:00:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102925812] [2022-03-19 22:00:13,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:13,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-19 22:00:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-19 22:00:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1685, Unknown=10, NotChecked=82, Total=1892 [2022-03-19 22:00:13,393 INFO L87 Difference]: Start difference. First operand 180 states and 234 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-19 22:00:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:16,524 INFO L93 Difference]: Finished difference Result 395 states and 533 transitions. [2022-03-19 22:00:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-19 22:00:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-03-19 22:00:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:16,526 INFO L225 Difference]: With dead ends: 395 [2022-03-19 22:00:16,526 INFO L226 Difference]: Without dead ends: 293 [2022-03-19 22:00:16,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=661, Invalid=8776, Unknown=73, NotChecked=192, Total=9702 [2022-03-19 22:00:16,529 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:16,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1264 Invalid, 0 Unknown, 105 Unchecked, 0.7s Time] [2022-03-19 22:00:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-03-19 22:00:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2022-03-19 22:00:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.354014598540146) internal successors, (371), 275 states have internal predecessors, (371), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:00:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2022-03-19 22:00:16,583 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 78 [2022-03-19 22:00:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:16,583 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2022-03-19 22:00:16,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-19 22:00:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2022-03-19 22:00:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-19 22:00:16,588 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:16,588 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:00:16,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-19 22:00:16,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:16,804 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:16,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1708055650, now seen corresponding path program 1 times [2022-03-19 22:00:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:16,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867184724] [2022-03-19 22:00:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:00:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:00:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 117 proven. 92 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-03-19 22:00:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:17,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867184724] [2022-03-19 22:00:17,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867184724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:17,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928263638] [2022-03-19 22:00:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:17,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:17,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:00:17,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-19 22:00:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:17,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-19 22:00:17,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:17,736 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:00:17,736 INFO L390 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 11 [2022-03-19 22:00:17,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-19 22:00:17,949 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:00:17,949 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:00:18,420 INFO L390 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 16 treesize of output 18 [2022-03-19 22:00:18,678 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-19 22:00:18,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-19 22:00:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-03-19 22:00:18,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:18,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_447) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 4)) 1)) is different from false [2022-03-19 22:00:18,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928263638] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:18,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:00:18,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2022-03-19 22:00:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71263724] [2022-03-19 22:00:18,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:18,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-19 22:00:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-19 22:00:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2093, Unknown=11, NotChecked=92, Total=2352 [2022-03-19 22:00:18,949 INFO L87 Difference]: Start difference. First operand 284 states and 380 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-03-19 22:00:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:22,160 INFO L93 Difference]: Finished difference Result 621 states and 851 transitions. [2022-03-19 22:00:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-19 22:00:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 86 [2022-03-19 22:00:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:22,162 INFO L225 Difference]: With dead ends: 621 [2022-03-19 22:00:22,162 INFO L226 Difference]: Without dead ends: 476 [2022-03-19 22:00:22,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=930, Invalid=10756, Unknown=90, NotChecked=214, Total=11990 [2022-03-19 22:00:22,166 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 155 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:22,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 150 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 893 Invalid, 0 Unknown, 182 Unchecked, 0.5s Time] [2022-03-19 22:00:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-03-19 22:00:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 444. [2022-03-19 22:00:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 431 states have (on average 1.3735498839907192) internal successors, (592), 432 states have internal predecessors, (592), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:00:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 605 transitions. [2022-03-19 22:00:22,235 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 605 transitions. Word has length 86 [2022-03-19 22:00:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:22,236 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 605 transitions. [2022-03-19 22:00:22,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-03-19 22:00:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 605 transitions. [2022-03-19 22:00:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-19 22:00:22,238 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:22,238 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:00:22,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-19 22:00:22,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-19 22:00:22,458 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1561022526, now seen corresponding path program 2 times [2022-03-19 22:00:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:22,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100901218] [2022-03-19 22:00:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-19 22:00:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-03-19 22:00:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-03-19 22:00:22,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:22,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100901218] [2022-03-19 22:00:22,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100901218] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:00:22,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:00:22,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 22:00:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107396584] [2022-03-19 22:00:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:00:22,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 22:00:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 22:00:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-19 22:00:22,553 INFO L87 Difference]: Start difference. First operand 444 states and 605 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 22:00:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:22,800 INFO L93 Difference]: Finished difference Result 868 states and 1188 transitions. [2022-03-19 22:00:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 22:00:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-03-19 22:00:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:22,803 INFO L225 Difference]: With dead ends: 868 [2022-03-19 22:00:22,803 INFO L226 Difference]: Without dead ends: 451 [2022-03-19 22:00:22,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-03-19 22:00:22,804 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:22,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 26 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:00:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-03-19 22:00:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2022-03-19 22:00:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 428 states have (on average 1.3714953271028036) internal successors, (587), 429 states have internal predecessors, (587), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-19 22:00:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 598 transitions. [2022-03-19 22:00:22,881 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 598 transitions. Word has length 88 [2022-03-19 22:00:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:22,881 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 598 transitions. [2022-03-19 22:00:22,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 22:00:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 598 transitions. [2022-03-19 22:00:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-19 22:00:22,883 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:22,883 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:00:22,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 22:00:22,883 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2091129168, now seen corresponding path program 3 times [2022-03-19 22:00:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:22,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513283766] [2022-03-19 22:00:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:00:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:00:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:23,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:00:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-03-19 22:00:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513283766] [2022-03-19 22:00:23,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513283766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714565689] [2022-03-19 22:00:23,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:00:23,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:23,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:00:23,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-19 22:00:23,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-19 22:00:23,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:00:23,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-19 22:00:23,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:23,763 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:00:23,764 INFO L390 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 11 [2022-03-19 22:00:23,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:00:23,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:00:23,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:00:23,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:00:23,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:00:23,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:23,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-03-19 22:00:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-03-19 22:00:24,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:24,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_main_~#array~1.base| v_ArrVal_566) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4))))) is different from false [2022-03-19 22:00:24,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_main_~#array~1.base_10| Int) (v_ArrVal_566 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |v_main_~#array~1.base_10| v_ArrVal_566) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4)))) (not (= (select |c_#valid| |v_main_~#array~1.base_10|) 0)))) is different from false [2022-03-19 22:00:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 9 not checked. [2022-03-19 22:00:24,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714565689] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:24,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:24,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2022-03-19 22:00:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790584882] [2022-03-19 22:00:24,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:24,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-19 22:00:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-19 22:00:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=991, Unknown=2, NotChecked=130, Total=1260 [2022-03-19 22:00:24,895 INFO L87 Difference]: Start difference. First operand 440 states and 598 transitions. Second operand has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-19 22:00:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:26,553 INFO L93 Difference]: Finished difference Result 757 states and 1040 transitions. [2022-03-19 22:00:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-19 22:00:26,554 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 94 [2022-03-19 22:00:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:26,555 INFO L225 Difference]: With dead ends: 757 [2022-03-19 22:00:26,555 INFO L226 Difference]: Without dead ends: 348 [2022-03-19 22:00:26,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=490, Invalid=2378, Unknown=2, NotChecked=210, Total=3080 [2022-03-19 22:00:26,557 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 153 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:26,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 24 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 579 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2022-03-19 22:00:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-03-19 22:00:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2022-03-19 22:00:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 327 states have (on average 1.385321100917431) internal successors, (453), 328 states have internal predecessors, (453), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-19 22:00:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 464 transitions. [2022-03-19 22:00:26,607 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 464 transitions. Word has length 94 [2022-03-19 22:00:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:26,607 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 464 transitions. [2022-03-19 22:00:26,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-19 22:00:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 464 transitions. [2022-03-19 22:00:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-19 22:00:26,609 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:26,609 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:00:26,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-19 22:00:26,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-19 22:00:26,823 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 332347090, now seen corresponding path program 4 times [2022-03-19 22:00:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:26,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174023267] [2022-03-19 22:00:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:00:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:00:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:00:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 46 proven. 183 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-19 22:00:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174023267] [2022-03-19 22:00:28,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174023267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983459413] [2022-03-19 22:00:28,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:00:28,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:28,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:00:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-19 22:00:28,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:00:28,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:00:28,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-19 22:00:28,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:28,579 INFO L356 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2022-03-19 22:00:28,579 INFO L390 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 4 case distinctions, treesize of input 55 treesize of output 42 [2022-03-19 22:00:28,793 INFO L356 Elim1Store]: treesize reduction 228, result has 8.8 percent of original size [2022-03-19 22:00:28,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 50 treesize of output 40 [2022-03-19 22:00:28,914 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-19 22:00:28,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 10 [2022-03-19 22:00:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 55 proven. 168 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-19 22:00:28,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:32,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-03-19 22:00:32,274 INFO L356 Elim1Store]: treesize reduction 81, result has 52.1 percent of original size [2022-03-19 22:00:32,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1034 treesize of output 991 [2022-03-19 22:00:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 152 proven. 53 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-03-19 22:00:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983459413] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:32,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:32,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 21, 16] total 68 [2022-03-19 22:00:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911320826] [2022-03-19 22:00:32,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:32,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-19 22:00:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-19 22:00:32,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4267, Unknown=1, NotChecked=0, Total=4556 [2022-03-19 22:00:32,733 INFO L87 Difference]: Start difference. First operand 339 states and 464 transitions. Second operand has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 22:02:14,875 WARN L232 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 99 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:02:27,805 WARN L232 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 77 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:02:52,533 WARN L232 SmtUtils]: Spent 10.72s on a formula simplification. DAG size of input: 85 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:03:36,122 WARN L232 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:04:06,826 WARN L232 SmtUtils]: Spent 18.38s on a formula simplification. DAG size of input: 84 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:04:38,397 WARN L232 SmtUtils]: Spent 22.22s on a formula simplification. DAG size of input: 85 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:05:06,300 WARN L232 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:05:57,517 WARN L232 SmtUtils]: Spent 18.17s on a formula simplification. DAG size of input: 73 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:06:18,489 WARN L232 SmtUtils]: Spent 18.16s on a formula simplification. DAG size of input: 74 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:06:59,784 WARN L232 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:07:18,048 WARN L232 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 92 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:07:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:39,647 INFO L93 Difference]: Finished difference Result 1797 states and 2490 transitions. [2022-03-19 22:07:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2022-03-19 22:07:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 94 [2022-03-19 22:07:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:39,653 INFO L225 Difference]: With dead ends: 1797 [2022-03-19 22:07:39,653 INFO L226 Difference]: Without dead ends: 1545 [2022-03-19 22:07:39,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 196 SyntacticMatches, 7 SemanticMatches, 536 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124676 ImplicationChecksByTransitivity, 427.2s TimeCoverageRelationStatistics Valid=16854, Invalid=271980, Unknown=72, NotChecked=0, Total=288906 [2022-03-19 22:07:39,682 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 993 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4575 mSolverCounterSat, 1347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1347 IncrementalHoareTripleChecker+Valid, 4575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4220 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:39,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 127 Invalid, 10142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1347 Valid, 4575 Invalid, 0 Unknown, 4220 Unchecked, 3.1s Time] [2022-03-19 22:07:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-03-19 22:07:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 862. [2022-03-19 22:07:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 850 states have (on average 1.4058823529411764) internal successors, (1195), 851 states have internal predecessors, (1195), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-19 22:07:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1206 transitions. [2022-03-19 22:07:39,867 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1206 transitions. Word has length 94 [2022-03-19 22:07:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:39,868 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1206 transitions. [2022-03-19 22:07:39,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 22:07:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1206 transitions. [2022-03-19 22:07:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-19 22:07:39,870 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:39,870 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:07:39,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:40,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-19 22:07:40,087 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1911636208, now seen corresponding path program 5 times [2022-03-19 22:07:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300409750] [2022-03-19 22:07:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:07:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:07:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:07:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:07:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-03-19 22:07:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:07:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300409750] [2022-03-19 22:07:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300409750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686205636] [2022-03-19 22:07:40,802 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-19 22:07:40,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:40,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:07:40,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:07:40,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-19 22:07:41,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-03-19 22:07:41,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:07:41,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-19 22:07:41,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:07:41,050 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:07:41,050 INFO L390 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 11 [2022-03-19 22:07:41,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-19 22:07:41,194 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:41,194 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:41,244 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:41,245 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:41,648 INFO L390 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 16 treesize of output 18 [2022-03-19 22:07:42,010 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-19 22:07:42,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-19 22:07:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-03-19 22:07:42,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:07:42,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_734) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 8)))) is different from false [2022-03-19 22:07:42,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686205636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:42,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:07:42,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2022-03-19 22:07:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317075560] [2022-03-19 22:07:42,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:07:42,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-19 22:07:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:07:42,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-19 22:07:42,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1421, Unknown=11, NotChecked=76, Total=1640 [2022-03-19 22:07:42,336 INFO L87 Difference]: Start difference. First operand 862 states and 1206 transitions. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-19 22:07:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:43,858 INFO L93 Difference]: Finished difference Result 1671 states and 2349 transitions. [2022-03-19 22:07:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-19 22:07:43,859 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 94 [2022-03-19 22:07:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:43,862 INFO L225 Difference]: With dead ends: 1671 [2022-03-19 22:07:43,862 INFO L226 Difference]: Without dead ends: 840 [2022-03-19 22:07:43,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=397, Invalid=3842, Unknown=55, NotChecked=128, Total=4422 [2022-03-19 22:07:43,864 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:43,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 210 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 861 Invalid, 0 Unknown, 188 Unchecked, 0.4s Time] [2022-03-19 22:07:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-19 22:07:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2022-03-19 22:07:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 824 states have (on average 1.4053398058252426) internal successors, (1158), 825 states have internal predecessors, (1158), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:07:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1171 transitions. [2022-03-19 22:07:44,016 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1171 transitions. Word has length 94 [2022-03-19 22:07:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:44,016 INFO L478 AbstractCegarLoop]: Abstraction has 838 states and 1171 transitions. [2022-03-19 22:07:44,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-19 22:07:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1171 transitions. [2022-03-19 22:07:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-19 22:07:44,019 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:44,019 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:07:44,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:44,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-19 22:07:44,242 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1699502714, now seen corresponding path program 6 times [2022-03-19 22:07:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:44,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864335634] [2022-03-19 22:07:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:07:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:07:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:07:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:45,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:07:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-19 22:07:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 7 proven. 181 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-03-19 22:07:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:07:45,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864335634] [2022-03-19 22:07:45,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864335634] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:45,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050186147] [2022-03-19 22:07:45,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-19 22:07:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:07:45,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:07:45,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-19 22:07:45,369 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-03-19 22:07:45,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:07:45,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-19 22:07:45,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:07:45,415 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:07:45,415 INFO L390 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 11 [2022-03-19 22:07:45,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-19 22:07:45,580 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:45,581 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:45,638 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-03-19 22:07:45,639 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-03-19 22:07:45,728 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-03-19 22:07:45,729 INFO L390 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 1 case distinctions, treesize of input 29 treesize of output 34 [2022-03-19 22:07:46,340 INFO L390 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 27 treesize of output 27 [2022-03-19 22:07:47,454 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-03-19 22:07:47,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 13 [2022-03-19 22:07:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-03-19 22:07:47,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:07:47,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_823) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 12)))) is different from false [2022-03-19 22:07:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050186147] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:47,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:07:47,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-03-19 22:07:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146850265] [2022-03-19 22:07:47,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:07:47,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-19 22:07:47,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:07:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-19 22:07:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2367, Unknown=14, NotChecked=98, Total=2652 [2022-03-19 22:07:47,884 INFO L87 Difference]: Start difference. First operand 838 states and 1171 transitions. Second operand has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-19 22:07:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:50,330 INFO L93 Difference]: Finished difference Result 1633 states and 2290 transitions. [2022-03-19 22:07:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-19 22:07:50,331 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 102 [2022-03-19 22:07:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:50,334 INFO L225 Difference]: With dead ends: 1633 [2022-03-19 22:07:50,334 INFO L226 Difference]: Without dead ends: 871 [2022-03-19 22:07:50,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 110 SyntacticMatches, 13 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=515, Invalid=7100, Unknown=45, NotChecked=172, Total=7832 [2022-03-19 22:07:50,337 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:50,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 284 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 699 Invalid, 0 Unknown, 355 Unchecked, 0.4s Time] [2022-03-19 22:07:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-19 22:07:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 862. [2022-03-19 22:07:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 846 states have (on average 1.3995271867612293) internal successors, (1184), 847 states have internal predecessors, (1184), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-19 22:07:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1199 transitions. [2022-03-19 22:07:50,492 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1199 transitions. Word has length 102 [2022-03-19 22:07:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:50,492 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1199 transitions. [2022-03-19 22:07:50,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-19 22:07:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1199 transitions. [2022-03-19 22:07:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-19 22:07:50,520 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:50,520 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:07:50,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:50,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-19 22:07:50,721 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1203177028, now seen corresponding path program 7 times [2022-03-19 22:07:50,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:50,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824835157] [2022-03-19 22:07:50,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:07:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:50,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:07:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:07:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:07:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-19 22:07:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-19 22:07:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 123 proven. 92 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-03-19 22:07:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:07:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824835157] [2022-03-19 22:07:51,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824835157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776740696] [2022-03-19 22:07:51,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-19 22:07:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:07:51,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:07:51,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-19 22:07:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:51,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-19 22:07:51,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:07:51,777 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-19 22:07:51,777 INFO L390 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 11 [2022-03-19 22:07:51,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-19 22:07:51,910 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:51,910 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:51,971 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:51,972 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:52,030 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:52,031 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:52,094 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-19 22:07:52,095 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-19 22:07:52,627 INFO L390 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 16 treesize of output 18 [2022-03-19 22:07:53,296 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-19 22:07:53,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-19 22:07:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 9 proven. 163 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-03-19 22:07:53,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:07:53,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_914) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 16)) 4)) is different from false [2022-03-19 22:07:53,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776740696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:53,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:07:53,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2022-03-19 22:07:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88118040] [2022-03-19 22:07:53,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:07:53,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-19 22:07:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:07:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-19 22:07:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2559, Unknown=11, NotChecked=102, Total=2862 [2022-03-19 22:07:53,739 INFO L87 Difference]: Start difference. First operand 862 states and 1199 transitions. Second operand has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-19 22:07:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:56,758 INFO L93 Difference]: Finished difference Result 1860 states and 2619 transitions. [2022-03-19 22:07:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-19 22:07:56,758 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 110 [2022-03-19 22:07:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:56,762 INFO L225 Difference]: With dead ends: 1860 [2022-03-19 22:07:56,762 INFO L226 Difference]: Without dead ends: 1179 [2022-03-19 22:07:56,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 141 SyntacticMatches, 14 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2941 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=792, Invalid=10250, Unknown=92, NotChecked=208, Total=11342 [2022-03-19 22:07:56,765 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:56,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 243 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1060 Invalid, 0 Unknown, 187 Unchecked, 0.5s Time] [2022-03-19 22:07:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-03-19 22:07:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1025. [2022-03-19 22:07:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4081429990069514) internal successors, (1418), 1008 states have internal predecessors, (1418), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-19 22:07:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1435 transitions. [2022-03-19 22:07:56,999 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1435 transitions. Word has length 110 [2022-03-19 22:07:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:56,999 INFO L478 AbstractCegarLoop]: Abstraction has 1025 states and 1435 transitions. [2022-03-19 22:07:56,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-19 22:07:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1435 transitions. [2022-03-19 22:07:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-19 22:07:57,002 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:57,002 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:07:57,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:57,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-19 22:07:57,215 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -611444882, now seen corresponding path program 8 times [2022-03-19 22:07:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235412027] [2022-03-19 22:07:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:07:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 22:07:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-19 22:07:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-19 22:07:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-19 22:07:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-19 22:07:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-19 22:07:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-03-19 22:07:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:07:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235412027] [2022-03-19 22:07:57,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235412027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923564189] [2022-03-19 22:07:57,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:07:57,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:07:57,335 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:07:57,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-19 22:07:57,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:07:57,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:07:57,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 22:07:57,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:07:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-03-19 22:07:57,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 22:07:57,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923564189] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:07:57,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 22:07:57,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2022-03-19 22:07:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968952040] [2022-03-19 22:07:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:07:57,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 22:07:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:07:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 22:07:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-19 22:07:57,626 INFO L87 Difference]: Start difference. First operand 1025 states and 1435 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-19 22:07:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:57,869 INFO L93 Difference]: Finished difference Result 1028 states and 1438 transitions. [2022-03-19 22:07:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 22:07:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 118 [2022-03-19 22:07:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:57,870 INFO L225 Difference]: With dead ends: 1028 [2022-03-19 22:07:57,870 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 22:07:57,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-19 22:07:57,872 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:57,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 124 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:07:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 22:07:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 22:07:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 22:07:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 22:07:57,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-03-19 22:07:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:57,873 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 22:07:57,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-19 22:07:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 22:07:57,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 22:07:57,876 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 22:07:57,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:58,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:58,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 22:08:03,565 WARN L232 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 476 DAG size of output: 437 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 22:10:36,861 WARN L232 SmtUtils]: Spent 2.55m on a formula simplification. DAG size of input: 1152 DAG size of output: 1095 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 22:11:03,368 WARN L232 SmtUtils]: Spent 23.87s on a formula simplification. DAG size of input: 1083 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-19 22:11:03,942 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-03-19 22:11:03,942 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-03-19 22:11:03,942 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-03-19 22:11:03,942 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 40 52) no Hoare annotation was computed. [2022-03-19 22:11:03,943 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse9 (= (select .cse10 (+ 4 |main_~#array~1.offset|)) 1)) (.cse1 (= (select .cse10 |main_~#array~1.offset|) 0)) (.cse2 (<= 0 main_~i~1)) (.cse3 (= (select .cse10 (+ 16 |main_~#array~1.offset|)) 4)) (.cse4 (<= 5 ~n~0)) (.cse8 (= (select .cse10 (+ 12 |main_~#array~1.offset|)) 3)) (.cse5 (not (= |main_~#array~1.base| 3))) (.cse6 (= 2 (select .cse10 (+ 8 |main_~#array~1.offset|)))) (.cse7 (<= main_~i~1 4)) (.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (and .cse1 .cse2 (= main_~i~1 3) .cse3 .cse4 .cse5 .cse6 (= 3 |main_#t~mem9|) .cse7) (and .cse1 (= |main_#t~mem9| 0) .cse3 .cse8 .cse5 .cse6 .cse9 (= main_~i~1 0)) (not (= (select .cse0 |~#array~0.offset|) 0)) (and .cse1 (= |main_#t~mem9| 1) .cse3 .cse8 .cse5 (= main_~i~1 1) .cse6 .cse9) (not (= (select |old(#valid)| 3) 1)) (and .cse1 .cse2 .cse3 (= |main_#t~mem9| 4) (= main_~i~1 4) .cse4 .cse5 .cse6 .cse7) (not .cse4) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 (= main_~i~1 2) .cse6 (= 2 |main_#t~mem9|) .cse7) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|))))) [2022-03-19 22:11:03,943 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-03-19 22:11:03,943 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 40 52) no Hoare annotation was computed. [2022-03-19 22:11:03,943 INFO L882 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-03-19 22:11:03,943 INFO L878 garLoopResultBuilder]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse3 (+ 16 |~#array~0.offset|)) (.cse2 (+ |~#array~0.offset| 8)) (.cse1 (+ |~#array~0.offset| 12)) (.cse19 (select |#memory_int| |~#array~0.base|)) (.cse17 (+ |~#array~0.offset| 4)) (.cse16 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse15 (= (select .cse16 (+ 12 |main_~#array~1.offset|)) 3)) (.cse4 (= 0 (select .cse19 .cse17))) (.cse5 (= (select .cse19 .cse1) 0)) (.cse6 (= (select .cse16 (+ 16 |main_~#array~1.offset|)) 4)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= (select .cse19 |~#array~0.offset|) 0)) (.cse9 (= (select .cse19 .cse2) 0)) (.cse10 (not (= |main_~#array~1.base| 3))) (.cse11 (= (select .cse19 .cse3) 0)) (.cse12 (= 2 (select .cse16 (+ 8 |main_~#array~1.offset|)))) (.cse13 (= (select .cse16 (+ 4 |main_~#array~1.offset|)) 1)) (.cse14 (exists ((v_main_~i~1_79 Int)) (let ((.cse18 (select |#memory_int| |main_~#array~1.base|))) (and (<= v_main_~i~1_79 (+ main_~i~1 1)) (or (<= 2 v_main_~i~1_79) (= (select .cse18 (+ 12 |main_~#array~1.offset|)) 3)) (= v_main_~i~1_79 (select .cse18 (+ (* v_main_~i~1_79 4) |main_~#array~1.offset|))))))) (.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= 0 (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~i~1 0) .cse14) (not (= (select .cse0 |~#array~0.offset|) 0)) (and (= |#memory_int| |old(#memory_int)|) .cse7 (= main_~i~1 4) .cse10) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 (= main_~i~1 2) .cse11) (not (= (select |old(#valid)| 3) 1)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 (= main_~i~1 1) .cse11 .cse12) (not (<= 5 ~n~0)) (and .cse4 .cse5 (= main_~i~1 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse4 (= (select .cse16 |main_~#array~1.offset|) 0) .cse5 .cse6 .cse7 (<= (+ main_~i~1 1) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= (select .cse0 .cse17) 0)) (not (<= 0 |~#array~0.offset|))))) [2022-03-19 22:11:03,943 INFO L878 garLoopResultBuilder]: At program point L44-4(lines 44 45) the Hoare annotation is: (let ((.cse1 (+ |~#array~0.offset| 12)) (.cse2 (+ |~#array~0.offset| 8)) (.cse3 (+ 16 |~#array~0.offset|)) (.cse0 (select |old(#memory_int)| |~#array~0.base|)) (.cse5 (+ |~#array~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= 0 (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 0)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (let ((.cse4 (select |#memory_int| |~#array~0.base|)) (.cse6 (select |#memory_int| |main_~#array~1.base|))) (and (= 0 (select .cse4 .cse5)) (= (select .cse6 |main_~#array~1.offset|) 0) (= (select .cse4 .cse1) 0) (= (select .cse6 (+ 16 |main_~#array~1.offset|)) 4) (= (select |#valid| 3) 1) (<= (+ main_~i~1 1) 0) (= (select .cse4 |~#array~0.offset|) 0) (= (select .cse6 (+ 12 |main_~#array~1.offset|)) 3) (= (select .cse4 .cse2) 0) (not (= |main_~#array~1.base| 3)) (= (select .cse4 .cse3) 0) (= 2 (select .cse6 (+ 8 |main_~#array~1.offset|))) (= (select .cse6 (+ 4 |main_~#array~1.offset|)) 1))) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 .cse5) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-19 22:11:03,943 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 40 52) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (and (= |#memory_int| |old(#memory_int)|) (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-19 22:11:03,943 INFO L882 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L878 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse1 (<= 0 main_~i~1)) (.cse6 (select |old(#memory_int)| |~#array~0.base|)) (.cse0 (= (select .cse8 |main_~#array~1.offset|) 0)) (.cse2 (= (select .cse8 (+ 16 |main_~#array~1.offset|)) 4)) (.cse3 (= (select .cse8 (+ 12 |main_~#array~1.offset|)) 3)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse5 (= 2 (select .cse8 (+ 8 |main_~#array~1.offset|)))) (.cse7 (= (select .cse8 (+ 4 |main_~#array~1.offset|)) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~1 2) .cse5) (not (= (select .cse6 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse6 (+ |~#array~0.offset| 8)))) (not (= (select .cse6 (+ 16 |~#array~0.offset|)) 0)) (and .cse0 .cse1 .cse2 (= main_~i~1 4) .cse4 .cse5) (and .cse0 .cse1 (= main_~i~1 3) .cse2 .cse3 .cse4 .cse5) (not (= (select .cse6 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 (= main_~i~1 0)) (and .cse0 .cse1 (<= 5 main_~i~1) .cse4 .cse5) (not (= (select .cse6 (+ |~#array~0.offset| 4)) 0)) (and .cse0 .cse2 .cse3 .cse4 (= main_~i~1 1) .cse5 .cse7) (not (<= 0 |~#array~0.offset|))))) [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~n~0 |old(~n~0)|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point SelectionSortEXIT(lines 26 38) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L878 garLoopResultBuilder]: At program point SelectionSortENTRY(lines 26 38) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (= |#memory_int| |old(#memory_int)|) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and (< SelectionSort_~lh~0 ~n~0) (exists ((v_ArrVal_812 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |~#array~0.base| v_ArrVal_812)))) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2022-03-19 22:11:03,944 INFO L882 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 37) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|)) (.cse1 (exists ((v_ArrVal_351 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |~#array~0.base| v_ArrVal_351))))) (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (and (< ~n~0 (+ SelectionSort_~i~0 3)) .cse1) (and (<= ~n~0 (+ SelectionSort_~lh~0 4)) .cse1) (not (<= 0 |~#array~0.offset|)))) [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point L30-4(lines 26 38) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#array~0.base|))) (and (= 0 (select .cse0 (+ |~#array~0.offset| 4))) (= (select .cse0 (+ |~#array~0.offset| 12)) 0) (= 3 |~#array~0.base|) (= (select |#valid| 3) 1) (<= 5 ~n~0) (= (select .cse0 |~#array~0.offset|) 0) (= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= |~#array~0.offset| 0) (= (select .cse0 (+ 16 |~#array~0.offset|)) 0))) [2022-03-19 22:11:03,945 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-03-19 22:11:03,945 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-03-19 22:11:03,946 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-03-19 22:11:03,949 INFO L719 BasicCegarLoop]: Path program histogram: [8, 4, 2, 1, 1, 1, 1] [2022-03-19 22:11:03,950 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 22:11:03,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:03,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:03,965 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:03,965 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:03,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,977 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,977 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,978 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,978 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,983 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,983 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,983 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,983 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:03,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-19 22:11:03,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-19 22:11:03,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 10:11:03 BoogieIcfgContainer [2022-03-19 22:11:03,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 22:11:03,996 INFO L158 Benchmark]: Toolchain (without parser) took 681235.49ms. Allocated memory was 183.5MB in the beginning and 520.1MB in the end (delta: 336.6MB). Free memory was 127.7MB in the beginning and 269.9MB in the end (delta: -142.3MB). Peak memory consumption was 344.8MB. Max. memory is 8.0GB. [2022-03-19 22:11:03,996 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 22:11:03,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.77ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 127.5MB in the beginning and 220.8MB in the end (delta: -93.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-03-19 22:11:03,996 INFO L158 Benchmark]: Boogie Preprocessor took 46.45ms. Allocated memory is still 249.6MB. Free memory was 220.8MB in the beginning and 219.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 22:11:03,996 INFO L158 Benchmark]: RCFGBuilder took 348.54ms. Allocated memory is still 249.6MB. Free memory was 219.2MB in the beginning and 207.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-19 22:11:03,997 INFO L158 Benchmark]: TraceAbstraction took 680592.20ms. Allocated memory was 249.6MB in the beginning and 520.1MB in the end (delta: 270.5MB). Free memory was 206.6MB in the beginning and 269.9MB in the end (delta: -63.3MB). Peak memory consumption was 357.4MB. Max. memory is 8.0GB. [2022-03-19 22:11:03,997 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.77ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 127.5MB in the beginning and 220.8MB in the end (delta: -93.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.45ms. Allocated memory is still 249.6MB. Free memory was 220.8MB in the beginning and 219.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 348.54ms. Allocated memory is still 249.6MB. Free memory was 219.2MB in the beginning and 207.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 680592.20ms. Allocated memory was 249.6MB in the beginning and 520.1MB in the end (delta: 270.5MB). Free memory was 206.6MB in the beginning and 269.9MB in the end (delta: -63.3MB). Peak memory consumption was 357.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 680.5s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 462.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 185.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2746 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6004 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 2453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12562 IncrementalHoareTripleChecker+Invalid, 21019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2453 mSolverCounterUnsat, 453 mSDtfsCounter, 12562 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2933 GetRequests, 1557 SyntacticMatches, 66 SemanticMatches, 1310 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 140274 ImplicationChecksByTransitivity, 465.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1025occurred in iteration=17, InterpolantAutomatonStates: 946, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 64 PreInvPairs, 717 NumberOfFragments, 1790 HoareAnnotationTreeSize, 64 FomulaSimplifications, 189054 FormulaSimplificationTreeSizeReduction, 158.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 312418 FormulaSimplificationTreeSizeReductionInter, 26.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2691 ConstructedInterpolants, 287 QuantifiedInterpolants, 27677 SizeOfPredicates, 86 NumberOfNonLiveVariables, 3838 ConjunctsInSsa, 380 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 4595/7283 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2022-03-19 22:11:04,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:04,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:04,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-19 22:11:04,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] Derived loop invariant: ((((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || !(\valid[3] == 1)) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || (n < i + 3 && (\exists v_ArrVal_351 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_351]))) || (n <= lh + 4 && (\exists v_ArrVal_351 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_351]))) || !(0 <= array) - InvariantResult [Line: 44]: Loop Invariant [2022-03-19 22:11:04,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-19 22:11:04,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] Derived loop invariant: ((((((((((((((!(\old(unknown-#memory_int-unknown)[array][array + 12] == 0) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || (((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && i == 0) && (\exists v_main_~i~1_79 : int :: (v_main_~i~1_79 <= i + 1 && (2 <= v_main_~i~1_79 || unknown-#memory_int-unknown[array][12 + array] == 3)) && v_main_~i~1_79 == unknown-#memory_int-unknown[array][v_main_~i~1_79 * 4 + array]))) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \valid[3] == 1) && i == 4) && !(array == 3))) || (((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][12 + array] == 3) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && i == 2) && unknown-#memory_int-unknown[array][16 + array] == 0)) || !(\old(\valid)[3] == 1)) || ((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][12 + array] == 3) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && i == 1) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(5 <= n)) || ((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && i == 3) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0)) || !(3 == array)) || !(array <= 0)) || ((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && i + 1 <= 0) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && (\exists v_main_~i~1_79 : int :: (v_main_~i~1_79 <= i + 1 && (2 <= v_main_~i~1_79 || unknown-#memory_int-unknown[array][12 + array] == 3)) && v_main_~i~1_79 == unknown-#memory_int-unknown[array][v_main_~i~1_79 * 4 + array]))) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || !(0 <= array) - InvariantResult [Line: 32]: Loop Invariant [2022-03-19 22:11:04,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-19 22:11:04,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] Derived loop invariant: (((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || !(\valid[3] == 1)) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || (lh < n && (\exists v_ArrVal_812 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_812]))) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || !(0 <= array) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && i == 2) && 2 == unknown-#memory_int-unknown[array][8 + array]) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || (((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && unknown-#memory_int-unknown[array][16 + array] == 4) && i == 4) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || ((((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && i == 3) && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(\old(\valid)[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || ((((((unknown-#memory_int-unknown[array][array] == 0 && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && i == 0)) || ((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && 5 <= i) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || ((((((unknown-#memory_int-unknown[array][array] == 0 && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && i == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1)) || !(0 <= array) RESULT: Ultimate proved your program to be correct! [2022-03-19 22:11:04,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...